# CONSTRAINT BASED SCHEDULING IN A GENETIC ALGORITHM FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SETUP TIMES

### Aymen Sioud, Marc Gravel, Caroline Gagné

#### Abstract

This paper presents a hybrid approach based on the integration between Genetic Algorithm (GA) and Constraint Based Scheduling (CBS) approaches for solving a scheduling problem. The main contributions are the integration of the CBS approach in the reproduction and the intensification processes of a GA autonomously. The proposed methodology is applied to a single machine scheduling problem with sequence-dependent setup times for the objective of minimizing the total tardiness. A sensitivity analysis of the hybrid methodology is carried out to compare the performance of the GA and the integrated GA-CBS approaches on different benchmarks from the literature.

#### References

- 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.
- 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.
- Baptiste, P., LePape, C., and Nuijten, W. (2001). Constraint-Based Scheduling : Applying Constraint Programming to Scheduling Problems. Kluwer Academic Publishers.
- 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.
- Bierwirth, C., Mattfeld, D. C., and Kopfer, H. (1996). On permutation representations for scheduling problems. In PPSN IV: Proceedings of the 4th International Conference on Parallel Problem Solving from Nature, pages 310-318, London, UK. Springer-Verlag.
- 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.
- Du, J. and Leung, J. Y. T. (1990). Minimizing total tardiness on one machine is np-hard. Mathematics and Operations Researchs, 15:438-495.
- 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.
- Fromherz, M. P. (1999). Model-based configuration of machine control software. Technical report, In Configuration Papers from the AAAI Workshop.
- 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.
- 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.
- 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.
- 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.
- Holland, J. H. (1992). Adaptation in natural and artificial systems. MIT Press, Cambridge, MA, USA.
- ILOG (2003a). ILOG Scheduler 6.0. User Manual. ILOG.
- ILOG (2003b). ILOG Solver 6.0. User Manual. ILOG.
- 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.
- 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.
- 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.
- 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.
- Michalewicz, Z. (1996). Genetic algorithms + data structures = evolution programs (3rd ed.). Springer-Verlag, London, UK.
- Pinedo, M. (2002). Scheduling Theory, Algorithm and Systems. Prentice-Hall.
- 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.
- 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.
- Rubin, P. and Ragatz, G. (1995). Scheduling in a sequencedependent setup environment with genetic search. Computers and Operations Research, 22:85-99.
- 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.
- Spina, R., Galantucci, L., and Dassisti, M. (2003). A hybrid approach to the single line scheduling problem with multiple products and sequence-dependent time. Computers and Industrial Engineering, 45(4):573 - 583.
- Talbi, E. (2002). A taxonomy of hybrid metaheuristics. Journal of Heuristics, 8:541-564.
- Talbi, E.-G. (2009). Metaheuristics : from design to implementation. John Wiley & Sons.
- 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.
- 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.
- Yunes, T., Aron, I. D., and Hooker, J. N. (2010). An Integrated Solver for Optimization Problems. Operations Resaearch, 58(2):342-356.

#### Paper Citation

#### in Harvard Style

Sioud A., Gravel M. and Gagné C. (2010). **CONSTRAINT BASED SCHEDULING IN A GENETIC ALGORITHM FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SETUP TIMES** . In *Proceedings of the International Conference on Evolutionary Computation - Volume 1: ICEC, (IJCCI 2010)* ISBN 978-989-8425-31-7, pages 137-145. DOI: 10.5220/0003060601370145

#### in Bibtex Style

@conference{icec10,

author={Aymen Sioud and Marc Gravel and Caroline Gagné},

title={CONSTRAINT BASED SCHEDULING IN A GENETIC ALGORITHM FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SETUP TIMES},

booktitle={Proceedings of the International Conference on Evolutionary Computation - Volume 1: ICEC, (IJCCI 2010)},

year={2010},

pages={137-145},

publisher={SciTePress},

organization={INSTICC},

doi={10.5220/0003060601370145},

isbn={978-989-8425-31-7},

}

#### in EndNote Style

TY - CONF

JO - Proceedings of the International Conference on Evolutionary Computation - Volume 1: ICEC, (IJCCI 2010)

TI - CONSTRAINT BASED SCHEDULING IN A GENETIC ALGORITHM FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SETUP TIMES

SN - 978-989-8425-31-7

AU - Sioud A.

AU - Gravel M.

AU - Gagné C.

PY - 2010

SP - 137

EP - 145

DO - 10.5220/0003060601370145