PARALLEL MACHINE EARLINESS-TARDINESS SCHEDULING - Comparison of Two Metaheuristic Approaches

Marcin Bazyluk, Leszek Koszalka, Keith J. Burnham

Abstract

This paper considers the problem of parallel machine scheduling with the earliness and tardiness penalties (PMSP E/T) in which a set of sequence-independent jobs is to be scheduled on a set of given machines to minimize a sum of the weighted earliness and tardiness values. The weights and due dates of the jobs are distinct positive numbers. The machines are diverse - each has a different execution speed of the respective jobs, thus the problem becomes more complex. To handle this, it two heuristics are employed, namely: the genetic algorithm with the MCUOX crossover operator and the tabu search. The performances of the both approaches are evaluated and their dependency on the shape of the investigated instances examined. The results indicate the significant predominance of the genetic approach for the larger-sized instances.

References

  1. Baker, K. and Scudder, G. (1990). Sequencing with earliness and tardiness penalties: a review. Operations Research, 38:22-36.
  2. Bazyluk, M., Koszalka, L., and Burnham, K. (2006). Using heuristic algorithms for parallel machines job scheduling problem. Computer Systems Engineering.
  3. Cao, D., Chen, M., and Wan, G. (2005). Parallel machine selection and job scheduling to minimize machine cost and job tardiness. Computers and Operations Research, 32:1995-2012.
  4. Davis, L. (1991). Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York.
  5. Du, J. and Leong, J. (1990). Minimizing total tardiness on one machine is np-hard. Mathematics of Operations Research, 483-495:1990.
  6. Grefenstette, J. (1986). Optimization of control parameters for genetic algorithms. IEEE Transactions on Systems Man and Cybernetics, SMC-16:122-128.
  7. Hall, N. and Posner, M. (1991). Earliness-tardiness scheduling problems, i: weighted deviation of completion times about a common due date. Operations Research, 39:836-846.
  8. Kanet, J. (1981). Minimizing the average deviation of job completion times about a common due date. Naval Research Logistics Quarterly, 28:643-651.
  9. Nowicki, E. and Smutnicki, C. (2005). Metaheuristic optimization via memory and evolution. Kluwer Academic Publishers, pages 165-190.
  10. Schmitt, L. (2000). Theory of genetic algorithms. Theoretical Computer Science, 259:1-61.
  11. Sivrikaya-Serifoglu, F. and Ulusoy, G. (1999). Parallel machine scheduling with earliness and tardiness penalties. Computers & Operations Research, 26:773-787.
Download


Paper Citation


in Harvard Style

Bazyluk M., Koszalka L. and J. Burnham K. (2008). PARALLEL MACHINE EARLINESS-TARDINESS SCHEDULING - Comparison of Two Metaheuristic Approaches . In Proceedings of the Fifth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 978-989-8111-30-2, pages 80-85. DOI: 10.5220/0001476500800085


in Bibtex Style

@conference{icinco08,
author={Marcin Bazyluk and Leszek Koszalka and Keith J. Burnham},
title={PARALLEL MACHINE EARLINESS-TARDINESS SCHEDULING - Comparison of Two Metaheuristic Approaches},
booktitle={Proceedings of the Fifth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2008},
pages={80-85},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001476500800085},
isbn={978-989-8111-30-2},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Fifth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - PARALLEL MACHINE EARLINESS-TARDINESS SCHEDULING - Comparison of Two Metaheuristic Approaches
SN - 978-989-8111-30-2
AU - Bazyluk M.
AU - Koszalka L.
AU - J. Burnham K.
PY - 2008
SP - 80
EP - 85
DO - 10.5220/0001476500800085