Empirical study of dense schedule performance ratio on open-shop scheduling problem

dc.contributor.advisor	Huang, Wendy
dc.contributor.author	Yan, Qingxiang
dc.date.accessioned	2017-06-08T13:20:43Z
dc.date.available	2017-06-08T13:20:43Z
dc.date.created	2006
dc.date.issued	2006
dc.identifier.uri	http://knowledgecommons.lakeheadu.ca/handle/2453/3687
dc.description.abstract	In this paper, we study properties of dense schedules for the open-shop problems and their average performance ratio. After using two sets of test problems, we show that the average performance ratio of dense schedules is actually much better than ( ), the worst-case performance ratio in the conjecture. The results from randomly generated problems which have large sizes show that when the dimension of open-shop problems become larger, the average performance ratio is getting even smaller. Twelve heuristic algorithms to generate dense schedules are presented in Chapter 3 and the computational results of two sets of test problems are also provided.
dc.language.iso	en_US
dc.subject	Heuristic programming
dc.subject	Computer scheduling
dc.title	Empirical study of dense schedule performance ratio on open-shop scheduling problem
dc.type	Thesis
etd.degree.name	Master of Science
etd.degree.level	Master
etd.degree.discipline	Mathematical Sciences
etd.degree.grantor	Lakehead University