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	阿根廷vs墨西哥竞猜