TY - JOUR
T1 - A survey of algorithms for single and multi-objective unrelated parallel-machine deterministic scheduling problems
AU - Pfund, Michele
AU - Fowler, John
AU - Gupta, Jatinder N D
N1 - Funding Information:
Michele Pfund is a Visiting Professor in the Industrial Engineering Department at Arizona State University. Her research interests include scheduling and rescheduling for complex manufacturing environments, particularly under uncertainty. She is a Co-Principal Investigator on a project entitled "Scheduling of Wafer Fab Facilities" which is jointly funded by International SEMATECH and the Semiconductor Research Corporation. Prior to completing.
PY - 2004
Y1 - 2004
N2 - This paper surveys the literature related to solving traditional unrelated parallel-machine scheduling problems. It compiles algorithms for the makespan, total weighted sum of completion times, maximum tardiness, total tardiness, total earliness and tardiness, and multiple criteria performance measures. The review of the existing algorithms is restricted to the deterministic problems without setups, preemptions, or side conditions on the problem. Even for such traditional problems, this survey reveals that while makespan minimization has been fairly widely studied, problems that include processing characteristics such as release times, sequence dependent setups, and preemptions remain largely unstudied. Research in solving unrelated parallel-machine scheduling problems involving the minimization of the number of tardy jobs, weighted number of tardy jobs, total tardiness, and total weighted tardiness is quite limited.
AB - This paper surveys the literature related to solving traditional unrelated parallel-machine scheduling problems. It compiles algorithms for the makespan, total weighted sum of completion times, maximum tardiness, total tardiness, total earliness and tardiness, and multiple criteria performance measures. The review of the existing algorithms is restricted to the deterministic problems without setups, preemptions, or side conditions on the problem. Even for such traditional problems, this survey reveals that while makespan minimization has been fairly widely studied, problems that include processing characteristics such as release times, sequence dependent setups, and preemptions remain largely unstudied. Research in solving unrelated parallel-machine scheduling problems involving the minimization of the number of tardy jobs, weighted number of tardy jobs, total tardiness, and total weighted tardiness is quite limited.
KW - Multi-objective scheduling
KW - Parallel machines
KW - Scheduling
UR - http://www.scopus.com/inward/record.url?scp=24644516597&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=24644516597&partnerID=8YFLogxK
U2 - 10.1080/10170660409509404
DO - 10.1080/10170660409509404
M3 - Article
AN - SCOPUS:24644516597
SN - 1017-0669
VL - 21
SP - 230
EP - 241
JO - Journal of the Chinese Institute of Industrial Engineers
JF - Journal of the Chinese Institute of Industrial Engineers
IS - 3
ER -