A new lower bound approach for single-machine multicriteria scheduling

Share/Save/Bookmark

Hoogeveen, J.A. and Velde, S.L. van de (1992) A new lower bound approach for single-machine multicriteria scheduling. Operations Research Letters, 11 (1). pp. 39-44. ISSN 0167-6377

open access
[img]
Preview
PDF
439kB
Abstract:The concept of maximum potential improvement has played an important role in computing lower bounds for single-machine scheduling problems with composite objective functions that are linear in the job completion times. We introduce a new method for lower bound computation; objective splitting. We show that it dominates the maximum potential improvement method in terms of speed and quality.
Item Type:Article
Copyright:© 1992 Elsevier Science
Link to this item:http://purl.utwente.nl/publications/32286
Official URL:http://dx.doi.org/10.1016/0167-6377(92)90060-G
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 144540