List scheduling revisited

Share/Save/Bookmark

Schutten, J.M.J. (1996) List scheduling revisited. Operations Research Letters, 18 (4). pp. 167-170. ISSN 0167-6377

[img]
Preview
PDF
340Kb
Abstract:We consider the problem of scheduling n jobs on m identical parallel machines to minimize a regular cost function. The standard list scheduling algorithm converts a list into a feasible schedule by focusing on the job start times. We prove that list schedules are dominant for this type of problem. Furthermore, we prove that an alternative list scheduling algorithm, focusing on the completion times rather than the start times, yields also dominant list schedules for problems with sequence dependent setup times.
Item Type:Article
Copyright:© 1996 Elsevier Science
Faculty:
Management and Governance (SMG)
Research Chair:
Research Group:
Link to this item:http://purl.utwente.nl/publications/32185
Official URL:http://dx.doi.org/10.1016/0167-6377(95)00057-7
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 144432