Minimizing makespans for unrelated parallel machine scheduling problems

Y. K. Lin; M. E. Pfund; John Fowler

doi:10.1109/SOLI.2009.5203913

Minimizing makespans for unrelated parallel machine scheduling problems

Y. K. Lin, M. E. Pfund, John Fowler

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Scopus citations

Abstract

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

Original language	English (US)
Title of host publication	2009 IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics, SOLI 2009
Pages	107-110
Number of pages	4
DOIs	https://doi.org/10.1109/SOLI.2009.5203913
State	Published - 2009
Event	2009 IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics, SOLI 2009 - Chicago, IL, United States Duration: Jul 22 2009 → Jul 24 2009

Publication series

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

Other

Other	2009 IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics, SOLI 2009
Country/Territory	United States
City	Chicago, IL
Period	7/22/09 → 7/24/09

ASJC Scopus subject areas

Information Systems
Information Systems and Management
Industrial and Manufacturing Engineering

Access to Document

10.1109/SOLI.2009.5203913

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). Article 5203913 (2009 IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics, SOLI 2009). 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 (2009 IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics, SOLI 2009).

Research output: Chapter in Book/Report/Conference proceeding › Conference 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, 2009 IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics, SOLI 2009, 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. (2009 IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics, SOLI 2009). doi: 10.1109/SOLI.2009.5203913

@inproceedings{047fd552f3cb45a1852430fd3699cc30,

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",

series = "2009 IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics, SOLI 2009",

pages = "107--110",

booktitle = "2009 IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics, SOLI 2009",

note = "2009 IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics, SOLI 2009 ; Conference date: 22-07-2009 Through 24-07-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

SN - 9781424435418

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

SP - 107

EP - 110

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

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

Y2 - 22 July 2009 through 24 July 2009

ER -

Minimizing makespans for unrelated parallel machine scheduling problems

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this