Ant colony system for job shop scheduling with time windows

International Journal of Advanced Manufacturing Technology

Volumn 39, Issue 1-2, 2008, Pages 151-157

  Huang, Rong Hwa ^a   Yang, Chang Lin ^a  

^a FU JEN CATHOLIC UNIVERSITY   (Taiwan)

Author keywords

Ant colony optimization; Job shop; Scheduling; Time window

Indexed keywords

CONTRACTS; INDUSTRIAL MANAGEMENT; MATERIALS HANDLING; MATHEMATICAL MODELS; NUCLEAR PROPULSION; OPTIMIZATION; PRODUCTION CONTROL; SALES; SOLUTIONS; VEHICLE ROUTING; WINDOWS;

ANT COLONY OPTIMIZATION; ANT COLONY SYSTEM; BEST SOLUTION; BUSINESS MANAGEMENT; DUE DATES; IDLE TIME; JOB SHOP; JOB SHOP SCHEDULING PROBLEM; JOB SHOP-SCHEDULING; JOB-SHOP PRODUCTION; NP-HARD; ON-TIME DELIVERY; PRODUCTION MANAGEMENT; SCHEDULING OPERATIONS; SOLUTION TIME; TEST RESULTS; TIME WINDOW; TIME WINDOWS;

SCHEDULING;

EID: 52649172737     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-007-1203-9     Document Type: Article

References (20)

1. J Carlier E Pinson 1989 An algorithm for solving the job-shop problem Manage Sci 5 146 176
2. S Webster M Azizoglu 2001 Dynamic programming algorithms for scheduling parallel machines with family setup times Comput Oper Res 28 127 137
3. JU Kim YD Kim 1996 Simulated annealing and genetic algorithms for scheduling products with multi-level product structure Comput Oper Res 23 857 868
4. Chen H, Ihlow J, Lehmann C (1999) A genetic algorithm for flexible job-shop scheduling. Proceedings of the 1999 IEEE international conference on robotics and automation, Detroit, Michigan, pp 1120-1125
5. I Lee MJ Shaw 2000 A neural-net approach to real time flow-shop sequencing Comput Ind Eng 38 125 147
6. JA Ferland S Ichoua A Lavoie E Gagne 2001 Scheduling using tabu search methods with intensification and diversification Comput Oper Res 28 1075 1092
7. V Laarhoven PJM Aarts JK Lenstra 1992 Job shop scheduling by simulated annealing Oper Res 40 113 125
8. R Aggoune 2003 Minimizing the makespan for the flow shop scheduling problem with availability constraints Eur J Oper Res 153 534 543
9. VA Armentano DP Ronconi 1999 Tabu search for total tardiness minimization in flowshop scheduling problems Comput Oper Res 26 219 235
10. ZL Chen CY Lee 2002 Parallel machine scheduling with a common due window Eur J Oper Res 136 512 527
11. EK Baker 1983 An exact algorithm for the time-constrained traveling salesman problem Oper Res 31 938 945
12. MM Solomon J Desrosiers 1988 Time windows constrained routing and scheduling problem Transp Sci 22 1 13
13. Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE T Evolut Comput 1:53-66
14. L Gambardella E Taillard M Dorigo 1999 Ant colonies for the quadratic assignment problem J Oper Res Soc 50 167 176
15. PR McMullen 2001 An ant colony optimization approach to addressing a JIT sequencing problem with multiple objectives Artif Intell Eng 15 309 317
16. KC Ying CJ Liao 2004 Ant colony system for permutation flow-shop sequencing Comput Oper Res 31 791 801
17. A Dorigo Colorni M Dorigo V Maniezzo M Trubian 1994 Ant system for job-shop scheduling Belg J Oper Res 34 39 53
18. Zwaan SVD, Marques C (1999) Ant colony optimization for job shop scheduling. Proceedings of the 1999 workshop on genetic algorithms and artificial life (GAAL'99), Lisbon, Portugal
19. Dorigo M (1992) Learning and natural algorithm. PhD thesis, DEI, Politecnico di Milano, Italy
20. WX Zheng H Nagasawa N Nishiyama 1993 Single-machine scheduling for minimizing total cost with identical, asymmetrical earliness and tardiness penalties Int J Prod Res 31 1611 1620