| dc.creator |
Kolen, A.W. J. |
|
| dc.creator |
Rinnooy Kan, A. H. G. |
|
| dc.creator |
Van Hoesel, C. P. M. |
|
| dc.creator |
Wagelmans, Albert |
|
| dc.date |
2004-05-28T19:30:56Z |
|
| dc.date |
2004-05-28T19:30:56Z |
|
| dc.date |
1990-10 |
|
| dc.date.accessioned |
2013-10-09T02:38:41Z |
|
| dc.date.available |
2013-10-09T02:38:41Z |
|
| dc.date.issued |
2013-10-09 |
|
| dc.identifier |
http://hdl.handle.net/1721.1/5268 |
|
| dc.identifier.uri |
http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
|
| dc.description |
When jobs have to be processed on a set of identical parallel machines so as to minimize the makespan of the schedule, list scheduling rules form a popular class of heuristics. The order in which jobs appear on the list is assumed here to be determined by the relative size of their processing times; well known special cases are the LPT rule and the SPT rule, in which the jobs are ordered according to non-increasing and non-decreasing processing time respectively. When one of the job processing times is gradually increased, the schedule produced by a list scheduling rule will be affected in a manner reflecting its sensitivity to data perturbations. We analyze this phenomenon and obtain analytical support for the intuitively plausible notion that the sensitivity of a list scheduling rule increases with the quality of the schedule produced. |
|
| dc.format |
1744 bytes |
|
| dc.format |
1241011 bytes |
|
| dc.format |
application/pdf |
|
| dc.language |
en_US |
|
| dc.publisher |
Massachusetts Institute of Technology, Operations Research Center |
|
| dc.relation |
Operations Research Center Working Paper;OR 229-90 |
|
| dc.title |
Sensitivity Analysis of List Scheduling Heuristics |
|
| dc.type |
Working Paper |
|