Combining metaheuristics for the job shop scheduling problem with sequence dependent setup times

ICSOFT 2006 - 1st International Conference on Software and Data Technologies, Proceedings

Volumn 2, Issue , 2006, Pages 211-218

  González, Miguel A ^a   Sierra, María R ^a   Vela, Camino R ^a   Varela, Ramiro ^a   Puente, Jorge ^a  

^a UNIVERSITY OF OVIEDO   (Spain)

Author keywords

Genetic algorithms; Job shop scheduling; Local search; Metaheuristics

Indexed keywords

APPROXIMATE METHODS; EXACT METHODS; EXPERIMENTAL STUDIES; HARD PROBLEMS; HEURISTIC KNOWLEDGE; JOB SHOP SCHEDULING PROBLEMS; JOB-SHOP SCHEDULING; LOCAL SEARCH; LOCAL SEARCH METAHEURISTICS; LOCAL SEARCH METHOD; META HEURISTICS; PROBLEM MODELS; REAL SITUATION; SEQUENCE-DEPENDENT SETUP TIME; STATE-OF-THE-ART APPROACH;

APPROXIMATION THEORY; ARTIFICIAL INTELLIGENCE; COMPUTER SOFTWARE; GENETIC ALGORITHMS;

HEURISTIC METHODS;

EID: 58849093096     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Artigues, C., Belmokhtar, S., and Feillet, D. (2004). A New Exact Algorithm for the Job shop Problem with Sequence Dependent Setup Times, pages 96-109. LNCS 3011. Springer-Verlag.
2. Artigues, C., Lopez, P., and P.D., A. (2005). Schedule generation schemes for the job shop problem with sequence-dependent setup times: Dominance properties and computational analysis. Annals of Operational Research, 138:21-52.
3. Bierwirth, C. (1995). A generalized permutation approach to jobshop scheduling with genetic algorithms. OR Spectrum, 17:87-92.
4. Brucker, P. (2004). Scheduling Algorithms. Springer- Verlag, 4th edition.
5. Brucker, P., Jurisch, B., and Sievers, B. (1994). A branch and bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics, 49:107-127.
6. Brucker, P. and Thiele, O. (1996). A branch and bound method for the general-job shop problem with sequence-dependent setup times. Operations Research Spektrum, 18:145-161.
7. Carlier, J. and Pinson, E. (1994). Adjustment of heads and tails for the job-shop problem. European Journal of Operational Research, 78:146-161.
8. Cheung, W. and Zhou, H. (2001). Using genetic algorithms and heuristics for job shop scheduling with sequencedependent setup times. Annals of Operational Research, 107:65-81. (Pubitemid 33634450)
9. Dell' Amico, M. and Trubian, M. (1993). Applying tabu search to the job-shop scheduling problem. Annals of Operational Research, 41:231-252.
10. Giffler, B. and Thomson, G. (1960). Algorithms for solving production scheduling problems. Operations Reseach, 8:487-503.
11. González, M., Sierra, M., Vela, C., and Varela, R. (2006). Genetic Algorithms Hybridized with Greedy Algorithms and Local Search over the Spaces of Active and Semi-active Schedules. LNCS (to appear). Springer- Verlag.
12. Lawrence, S. (1984). Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement). Technical report, Graduate School of Industrial Administration, Carnegie Mellon University.
13. Mattfeld, D. (1995). Evolutionary Search and the Job Shop. Investigations on Genetic Algorithms for Production Scheduling. Springer-Verlag.
14. Nowicki, E. and Smutnicki, C. (1996). A fast taboo search algorithm for the job shop problem. Management Science, 42:797-813. (Pubitemid 126577322)
15. Ovacik, I. and Uzsoy, R. (1993). Exploiting shop floors status information to schedule complex jobs. Operations Research Letters, 14:251-256.
16. Taillard, E. (1993). Parallel taboo search techniques for the job shop scheduling problem. ORSA Journal of Computing, 6:108-117.
17. Varela, R., Serrano, D., and M., S. (2005). New Codification Schemas for Scheduling with Genetic Algorithms, pages 11-20. LNCS 3562. Springer-Verlag.
18. Varela, R., Vela, C., Puente, J., and A., G. (2003). A knowledge-based evolutionary strategy for scheduling problems with bottlenecks. European Journal of Operational Research, 145:57-71.
19. Zoghby, J., Barnes, J., and J.J., H. (2005). Modeling the re-entrant job shop scheduling problem with setup for metaheuristic searches. European Journal of Operational Research, 167:336-348.