Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method

Robotics and Computer-Integrated Manufacturing

Volumn 23, Issue 5, 2007, Pages 503-516

  Rossi, Andrea ^a   Dini, Gino ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Ant colony optimisation; Flexible manufacturing systems; Job shop scheduling

Indexed keywords

ALGORITHMS; JOB ANALYSIS; MATHEMATICAL OPERATORS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

ANT COLONY OPTIMIZATION; JOB-SHOP SCHEDULING; SETUP TIMES;

FLEXIBLE MANUFACTURING SYSTEMS;

EID: 34247624966     PISSN: 07365845     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.rcim.2006.06.004     Document Type: Article

References (32)

1. Stecke K.E., and Raman N. FMS planning decision, operating flexibilities and system performance. IEEE Trans Eng Manage 42 (1995) 82-90
2. Allahverdi A., Guptab J.N.D., and Aldowaisan T. A review of scheduling research involving setup considerations. Omega-Int J Manage S 27 (1999) 219-239
3. Brucker P., and Schlie R. Job-shop scheduling with multi-purpose machines. Computing 45 (1990) 369-375
4. Blazewicz J., Finke G., Haupt R., and Schmidt G. New trend in machine scheduling. Eur J Op Res 37 (1988) 303-317
5. Grieco A., Semeraro Q., and Tolio T. A review of different approaches to the FMS loading problem. Int J Flex Manuf Sys 13 (2001) 361-384
6. Suri R., and Desiraju R. Performance analysis of flexible manufacturing systems with a single discrete material-handling device. Int J Flex Manuf Sys 9 (1997) 223-249
7. Garey M.R., Johnson D.S., and Sethi R. The complexity of the flowshop and jobshop scheduling. Math Oper Res 1 (1976) 117-129
8. Jain A.S., and Meeran S. Deterministic Job shop scheduling; past, present and future. Eur J Op Res 113 (1999) 390-434
9. Blazewicz J., Domschke W., and Pesch E. The job shop scheduling problem: conventional and new solution techniques. Eur J Op Res 93 (1996) 1-33
10. Nabeshima I., and Maruyama S. Two- and three-machine flowshop makespan scheduling problems with additional times separated from processing times. J Oper Res Soc Japan 27 (1984) 348-366
11. Yang D.L., and Chern M.S. Two-machine flowshop group scheduling problem. Comput Oper Res 27 (2000) 975-985
12. Ivens P., and Lambrecht M. Extending the shifting bottleneck procedure to real-life applications. Eur J Op Res 90 (1996) 252-268
13. Roy B, Sussmann B. Les Problèmes d'Ordonnancement Avec Contraintes Disjonctives. Note DS No. 9 bis, SEMA, Montrouge, 1964.
14. Artigues C., and Roubellat F. A Petri net model and a general method for on and off-line multi-resource shop floor scheduling with setup times. Int J Prod Econ 74 (2001) 63-75
15. Hurink J., and Knust S. Tabu search algorithms for job-shop problems with a single transport robot. Eur J Op Res 162 (2005) 99-111
16. Rossi A., and Dini G. An evolutionary approach to complex job-shop scheduling and flexible manufacturing system scheduling. J Eng Manuf-Part B 215 (2001) 233-245
17. Bonabeau E., Dorigo M., and Theraulaz G. Inspiration for optimization from social insect behaviour. Nature 406 (2000) 39-42
18. Barnes JW, Chambers JB. Flexible job shop scheduling by Tabu search. Technical report series ORP 96-09. Department of Mechanical Engineering, University of Texas at Austin, 1996.
19. Dauzère-Pérès S., and Paulli J. An integrated approach for modelling and solving the general multiprocessor job-shop scheduling problem using Tabu search. Ann Oper Res 70 (1997) 281-306
20. Mastrolilli M., and Gambardella L.M. Effective neighborhood functions for the flexible job shop problem. J Sched 3 (2000) 3-20
21. Rossi A., and Dini G. Dynamic scheduling of FMS using a real-time genetic algorithm. Int J Prod Res 38 (2000) 1-20
22. De Almeida D., and Kellert P. An analytical queueing network model for flexible manufacturing systems with a discrete handling device and transfer blockings. Int J Flex Manuf Sys 12 (2000) 25-57
23. Brucker P., and Thiele O. A branch & bound method for the general-shop problem with sequence dependent setup-times. OR Spektrum 18 (1996) 145-161
24. Giffler D., and Thompson G.L. Algorithms for solving production scheduling problems. Oper Res 8 (1960) 487-503
25. Blum C., and Sampels M. An ant colony optimization algorithm for shop scheduling problem. J Math Model Algorithm 3 (2004) 285-308
26. Colorni A., Dorigo M., Maniezzo V., and Trubian M. Ant system for job-shop scheduling. Belg J Oper Res, Stat Comput Soc 34 (1994) 39-53
27. Kumar R., Tiwari M.K., and Shankar R. Scheduling of flexible manufacturing system: an ant colony optimization approach. J Eng Manuf-Part B 217 (2003) 1443-1453
28. Dorigo M., and Gambardella L.M. Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE T Evolut Comput 1 (1997) 53-66
29. Stutzle T., and Hoos H.H. MAX-MIN ant system. Future Gener Comp Sys 16 (2000) 889-914
30. Nowicki E., and Smutnicki C. A fast Taboo search algorithm for the job shop problem. Manage Sci 42 (1996) 797-813
31. Balas E., and Vazacopoulos A. Guided local search with shifting bottleneck for job shop scheduling. Manage Sci 44 (1998) 262-275
32. Applegate D., and Cook W. A computational study of the job-shop scheduling problem. ORSA-J Comput 3 (1991) 149-156