Please use this identifier to cite or link to this item:
https://knowledgecommons.lakeheadu.ca/handle/2453/3687
Title: | Empirical study of dense schedule performance ratio on open-shop scheduling problem |
Authors: | Yan, Qingxiang |
Keywords: | Heuristic programming;Computer scheduling |
Issue Date: | 2006 |
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. |
URI: | http://knowledgecommons.lakeheadu.ca/handle/2453/3687 |
metadata.etd.degree.discipline: | Mathematical Sciences |
metadata.etd.degree.name: | Master of Science |
metadata.etd.degree.level: | Master |
metadata.dc.contributor.advisor: | Huang, Wendy |
Appears in Collections: | Retrospective theses |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
YanQ2006m-1b.pdf | 1.46 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.