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 - 2009
Event2009 IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics, SOLI 2009 - Chicago, IL, United States
Duration: Jul 22 2009Jul 24 2009

Other

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

Fingerprint

Scheduling
Parallel machine scheduling
Makespan
Parallel machines
Heuristics

ASJC Scopus subject areas

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

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] https://doi.org/10.1109/SOLI.2009.5203913

Minimizing makespans for unrelated parallel machine scheduling problems. / Lin, Y. K.; Pfund, M. E.; Fowler, John.

2009 IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics, SOLI 2009. 2009. p. 107-110 5203913.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lin, YK, Pfund, ME & 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., 5203913, pp. 107-110, 2009 IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics, SOLI 2009, Chicago, IL, United States, 7/22/09. https://doi.org/10.1109/SOLI.2009.5203913
Lin YK, Pfund ME, Fowler J. Minimizing makespans for unrelated parallel machine scheduling problems. In 2009 IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics, SOLI 2009. 2009. p. 107-110. 5203913 https://doi.org/10.1109/SOLI.2009.5203913
Lin, Y. K. ; Pfund, M. E. ; Fowler, John. / Minimizing makespans for unrelated parallel machine scheduling problems. 2009 IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics, SOLI 2009. 2009. pp. 107-110
@inproceedings{7239b552feb04eee827f802dadbbfb46,
title = "Minimizing makespans for unrelated parallel machine scheduling problems",
abstract = "This research proposes a two-phase heuristic and an improvement procedure for scheduling unrelated parallel machines problems to minimize makespan.",
author = "Lin, {Y. K.} and Pfund, {M. E.} and John Fowler",
year = "2009",
doi = "10.1109/SOLI.2009.5203913",
language = "English (US)",
isbn = "9781424435418",
pages = "107--110",
booktitle = "2009 IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics, SOLI 2009",

}

TY - GEN

T1 - Minimizing makespans for unrelated parallel machine scheduling problems

AU - Lin, Y. K.

AU - Pfund, M. E.

AU - Fowler, John

PY - 2009

Y1 - 2009

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

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

UR - http://www.scopus.com/inward/record.url?scp=70449506185&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70449506185&partnerID=8YFLogxK

U2 - 10.1109/SOLI.2009.5203913

DO - 10.1109/SOLI.2009.5203913

M3 - Conference contribution

AN - SCOPUS:70449506185

SN - 9781424435418

SP - 107

EP - 110

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

ER -