Abstract

This research proposes a two-phase heuristic and an improvement procedure for scheduling unrelated parallel machines problems to minimize makespan.

Original languageEnglish (US)
Title of host publication2009 IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics, SOLI 2009
Pages107-110
Number of pages4
DOIs
StatePublished - Nov 19 2009
Event2009 IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics, SOLI 2009 - Chicago, IL, United States
Duration: Jul 22 2009Jul 24 2009

Publication series

Name2009 IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics, SOLI 2009

Other

Other2009 IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics, SOLI 2009
CountryUnited States
CityChicago, IL
Period7/22/097/24/09

ASJC Scopus subject areas

  • Information Systems
  • Information Systems and Management
  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'Minimizing makespans for unrelated parallel machine scheduling problems'. Together they form a unique fingerprint.

  • Cite this

    Lin, Y. K., Pfund, M. E., & Fowler, J. (2009). Minimizing makespans for unrelated parallel machine scheduling problems. In 2009 IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics, SOLI 2009 (pp. 107-110). [5203913] (2009 IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics, SOLI 2009). https://doi.org/10.1109/SOLI.2009.5203913