New Crossover Operator in a Hybrid Genetic Algorithm for the Single Machine Scheduling Problem with Sequence-dependent Setup Times

Aymen Sioud, Marc Gravel, Caroline Gagné

Abstract

This paper presents a new crossover operator based on Constraint Based Scheduling (CBS) approach in a Genetic Algorithm (GA) for solving a scheduling problem. The proposed hybrid crossover, noted as HCX, is applied in Hybrid Genetic Algoritym (HGA) to a single machine scheduling problem with sequence-dependent setup times for the objective of minimizing the total tardiness. Through numerical experiments we compare the performance of the GA and the HGA approaches on different benchmarks from the literature. These results indicate that the HGA is very competitive and generates solutions that approach those of the known reference sets.

References

  1. Allahverdi, A., Ng, C., Cheng, T., and Kovalyov, M. Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187(3):985 - 1032.
  2. Armentano, V. and Mazzini, R. (2000). A genetic algorithm for scheduling on a single machine with setup times and due dates. Production Planning and Controly, 11(7):713 - 720.
  3. Baptiste, P., LePape, C., and Nuijten, W. (2001). Constraint-Based Scheduling : Applying Constraint Programming to Scheduling Problems. Kluwer Academic Publishers.
  4. Beck, J. C. and Perron, L. (2000). Discrepancy bounded depth first search. In CP-AI-OR'2000: Fourth International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pages 7-17.
  5. Bigras, L., Gamache, M., and Savard, G. (2008). The timedependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times. Discrete Optimization, 5(4):663-762.
  6. Conner, G. (2009). 10 questions. Manufacturing Engineering Magazine, pages 93-99.
  7. Du, J. and Leung, J. Y. T. (1990). Minimizing total tardiness on one machine is np-hard. Mathematics and Operations Researchs, 15:438-495.
  8. Franca, P. M., Mendes, A., and Moscato, P. (2001). A memetic algorithm for the total tardiness single machine scheduling problem. European Journal of Operational Research, 132:224-242.
  9. Gagné, C., Gravel, M., and Price, W. L. (2005). Using metaheuristic compromise programming for the solution of multiple objective scheduling problems. The Journal of the Operational Research Society, 56:687-698.
  10. Gagné, C., Price, W., and Gravel, M. (2002). Comparing an aco algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times. Journal of the Operational Research Society, 53:895-906.
  11. Graham, R. L., Lawler, E. L., Lenstra, J. K., and Kan, A. G. H. R. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5:287-326.
  12. Gupta, S. R. and Smith, J. S. (2006). Algorithms for single machine total tardiness scheduling with sequence dependent setups. European Journal of Operational Research, 175(2):722-739.
  13. Holland, J. H. (1992). Adaptation in natural and artificial systems. MIT Press, Cambridge, MA, USA.
  14. ILOG (2003a). ILOG Scheduler 6.0. User Manual. ILOG.
  15. ILOG (2003b). ILOG Solver 6.0. User Manual. ILOG.
  16. Jourdan, L., Basseur, M., and Talbi, E.-G. (2009). Hybridizing exact methods and metaheuristics: A taxonomy. European Journal of Operational Research, 199(3):620-629.
  17. Lee, Y., Bhaskaram, K., and Pinedo, M. (1997). A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Transactions, 29:45- 52.
  18. Leung, J., Kelly, L., and Anderson, J. H. (2004). Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRC Press, Inc., Boca Raton, FL, USA.
  19. Liao, C. and Juan, H. (2007). An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups. Computers and Operations Research, 34:1899-1909.
  20. Meseguer, P. (1997). Interleaved depth-first search. In IJCAI'97: Proceedings of the Fifteenth international joint conference on Artifical intelligence, pages 1382- 1387, San Francisco, CA, USA. Morgan Kaufmann Publishers Inc.
  21. Michalewicz, Z. (1996). Genetic algorithms + data structures = evolution programs (3rd ed.). Springer-Verlag, London, UK.
  22. Pinedo, M. (2002). Scheduling Theory, Algorithm and Systems. Prentice-Hall.
  23. Puchinger, J. and Raidl, G. R. (2005). Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification. In Proceedings of the First International Work-Conference on the Interplay Between Natural and Artificial Computation, Las Palmas, Spain, LNCS.
  24. Ragatz, G. L. (1993). A branch-and-bound method for minimumtardiness sequencing on a single processor with sequence dependent setup times. In Proceedings twenty-fourth annual meeting of the Decision Sciences Institute, pages 1375-1377.
  25. Rubin, P. and Ragatz, G. (1995). Scheduling in a sequencedependent setup environment with genetic search. Computers and Operations Research, 22:85-99.
  26. Sioud, A., Gravel, M., and Gagné, C. (2009). New crossover operator for the single machine scheduling problem with sequence-dependent setup times. In GEM'09: The 2009 International Conference on Genetic and Evolutionary Methods.
  27. Sioud, A., Gravel, M., and Gagné, C. (2010a). Constraint based scheduling in a genetic algorithm for the single machine scheduling problem with sequence dependent setup times. In ICEC'2010: Proceedings of the International Conference on Evolutionary Computation, pages 137-145.
  28. Sioud, A., Gravel, M., and Gagné, C. (2010b). A modeling for the total tardiness smsdst problem using constraint programming. In Arabnia, H. R., de la Fuente, D., Kozerenko, E. B., Olivas, J. A., Chang, R., LaMonica, P. M., Liuzzi, R. A., and Solo, A. M. G., editors, ICAI, pages 588-594. CSREA Press.
  29. Sioud, A., Gravel, M., and Gagné, C. (2012). A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times. Computers & OR, 39(10):2415-2424.
  30. Talbi, E. (2002). A taxonomy of hybrid metaheuristics. Journal of Heuristics, 8:541-564.
  31. Talbi, E.-G. (2009). Metaheuristics : from design to implementation. John Wiley & Sons.
  32. Tan, K. and Narasimhan, R. (1997). Minimizing tardiness on a single processor with setup-dependent setup times: a simulated annealing approach. Omega, 25:619 - 634.
  33. Walsh, T. (1997). Depth-bounded discrepancy search. In IJCAI'97: Proceedings of the Fifteenth international joint conference on Artifical intelligence, pages 1388- 1393, San Francisco, CA, USA. Morgan Kaufmann Publishers Inc.
  34. Yunes, T., Aron, I. D., and Hooker, J. N. (2010). An Integrated Solver for Optimization Problems. Operations Resaearch, 58(2):342-356.
  35. Zhu, X. and Wilhelm, W. E. (2006). Scheduling and lot sizing with sequence-dependent setup: A literature review. IIE Transactions, 38(11):987-1007.
Download


Paper Citation


in Harvard Style

Sioud A., Gravel M. and Gagné C. (2012). New Crossover Operator in a Hybrid Genetic Algorithm for the Single Machine Scheduling Problem with Sequence-dependent Setup Times . In Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2012) ISBN 978-989-8565-33-4, pages 144-151. DOI: 10.5220/0004113101440151


in Bibtex Style

@conference{ecta12,
author={Aymen Sioud and Marc Gravel and Caroline Gagné},
title={New Crossover Operator in a Hybrid Genetic Algorithm for the Single Machine Scheduling Problem with Sequence-dependent Setup Times},
booktitle={Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2012)},
year={2012},
pages={144-151},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004113101440151},
isbn={978-989-8565-33-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2012)
TI - New Crossover Operator in a Hybrid Genetic Algorithm for the Single Machine Scheduling Problem with Sequence-dependent Setup Times
SN - 978-989-8565-33-4
AU - Sioud A.
AU - Gravel M.
AU - Gagné C.
PY - 2012
SP - 144
EP - 151
DO - 10.5220/0004113101440151