Flexible job shop scheduling with sequence-dependent setup and transportation times by ant colony with reinforced pheromone relationships

International Journal of Production Economics

Volumn 153, Issue , 2014, Pages 253-267

  Rossi, Andrea ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Benchmark problems; Computation time; Metaheuristics; Parallel machines; Swarm systems

Indexed keywords

ARTIFICIAL INTELLIGENCE; BENCHMARKING; REINFORCEMENT; SCHEDULING ALGORITHMS;

BENCH-MARK PROBLEMS; COMPUTATION TIME; META HEURISTICS; PARALLEL MACHINE; SWARM SYSTEMS;

FLEXIBLE MANUFACTURING SYSTEMS;

EID: 84900466232     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2014.03.006     Document Type: Article

References (32)

1. A. Allahverdi, J.N.D. Gupta, and T. Aldowaisan A survey of scheduling problems with setup times or costs Eur. J. Oper. Res. 187 2008 985 1032
2. C. Artigues, and F. Roubellat 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. 7 2001 63 75
3. E. Balas, and A. Vazacopoulos Guided local search with shifting bottleneck for job shop scheduling Manag. Sci. 44 1998 262 275
4. J. Blazewicz, W. Domschke, and E. Pesch The job shop scheduling problem: conventional and new solution techniques Eur. J. Oper. Res. 93 1996 1 33
5. C. Blum, and M. Sampels An ant colony optimization algorithm for shop scheduling problem J. Math. Model. Algorithms 3 2004 285 308
6. E. Bonabeau, M. Dorigo, and G. Theraulaz Inspiration for optimization from social insect behavior Nature 406 2000 39 42
7. P. Brucker, and R. Schlie Job-shop scheduling with multi-purpose machines Computing 45 1990 369 375
8. P. Brucker, and O. Thiele A branch & bound method for the general-shop problem with sequence dependent setup-times Oper. Res. Spektrum 18 1996 145 161
9. F.T.S. Chan, T.C. Wong, and L.Y Chan Flexible job-shop scheduling problem under resource constraints Int. J. Prod. Res. 44 11 2006 2071 2089
10. A. Colorni, M. Dorigo, V. Maniezzo, and M. Trubian Ant system for job-shop scheduling Belg. J. Oper. Res.; Stat. Comput. Sci. 34 1994 39 53
11. S. Dauzère-Pérès, and J. Paulli An integrated approach for modelling and solving the general multiprocessor job-shop scheduling problem using tabu search Ann. Oper. Res. 70 1997 281 306
12. S. Dauzère-Pérès, W. Roux, and J.B. Lasserre Multi-resource shop scheduling with resource flexibility Eur. J. Oper. Res. 107 1998 289 305
13. De Jong, K.A.; Spears, W.M.; 1995. Using genetic algorithm to solve NP-complete problems. In: Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, pp. 124-132.
14. M. Dorigo, and L.M. Gambardella Ant colony system: a cooperative learning approach to the traveling salesman problem IEEE Trans. Evolut. Comput. 1 1997 53 66
15. M.R. Garey, D.S. Johnson, and R. Sethi The complexity of the flowshop and jobshop scheduling Math. Oper. Res. 1 1976 117 129
16. D. Giffler, and G.L. Thompson Algorithms for solving production scheduling problems Oper. Res. 8 1960 487 503
17. R.L. Graham, E.R. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan Optimization and approximation in deterministic sequencing and scheduling: a survey Ann. Discret. Math. 5 1979 287 326
18. J. Hurink, B. Jurisch, and M. Thole Tabu search for the job shop scheduling problem with multi-purpose machine Oper. Res. Spektrum 15 1994 205 215
19. J. Hurink, and S. Knust Tabu search algorithms for job-shop problems with a single transport robot Eur. J. Oper. Res. 162 2005 99 111
20. P. Ivens, and M. Lambrecht Extending the shifting bottleneck procedure to real-life applications Eur. J. Oper. Res. 90 1996 252 268
21. A.S. Jain, and S. Meeran Deterministic job shop scheduling; past, present and future Eur. J. Oper. Res. 113 1999 390 434
22. I. Kacem, S. Hammadi, and P. Borne Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems IEEE Trans. Syst. Man Cybern.; Part C 32 2002 1 13
23. R. Kumar, M.K. Tiwari, and R. Shankar Scheduling of flexible manufacturing system: an ant colony optimization approach J. Eng. Manuf. - Part B 217 2003 1443 1453
24. M. Mastrolilli, and L.M. Gambardella Effective neighborhood functions for the flexible job shop problem J. Sched. 3 2000 3 20
25. E. Nowicki, and C. Smutnicki A fast taboo search algorithm for the job shop problem Manag. Sci. 42 1996 797 813
26. A. Rossi, and G. Dini Dynamic scheduling of FMS using a real-time genetic algorithm Int. J. Prod. Res. 38 2000 1 20
27. A. Rossi, and G. Dini An evolutionary approach to complex job-shop scheduling and flexible manufacturing system scheduling J. Eng. Manuf. - Part B 215 2001 233 245
28. A. Rossi, and G. Dini Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method Robot. Comput.-Integr. Manuf. 23 2007 503 516
29. Rossi A. and Boschi E.; A hybrid heuristic to solve the parallel machines job-shop scheduling problem, Adv. Eng. Soft.; 40, 2009, 118-127.
30. B. Roy, and B. Sussmann Les Problèmes d'Ordonnancement Avec Contraintes Disjonctives. Technical report 1964 SEMA Montrouge (DS No. 9 bis)
31. K.E. Stecke, and N. Raman FMS planning decision, operating flexibilities and system performance IEEE Trans. Eng. Manag. 42 1995 82 90
32. T. Stutzle, and H.H. Hoos MAX-MIN ant system Future Gener. Comput. Syst. 16 2000 889 914