Scheduling job shop associated with multiple routings with genetic and ant colony heuristics

International Journal of Production Research

Volumn 47, Issue 14, 2009, Pages 3891-3917

  Girish, B S ^a   Jawahar, N ^a  

^a THIAGARAJAR COLLEGE OF ENGINEERING   (India)

Author keywords

Alternate routing; Flexible job shop problem; Genetic algorithm, ant colony optimisation; Heuristics

Indexed keywords

ALTERNATE ROUTINGS; ANT COLONIES; ANT COLONY ALGORITHMS; ANT COLONY OPTIMISATION; COMBINATORIAL OPTIMISATION; FLEXIBLE JOB-SHOP PROBLEM; JOB SHOP; JOB SHOP PROBLEM; JOB SHOP SCHEDULING PROBLEMS; MACHINE SCHEDULING PROBLEM; MATHEMATICAL APPROACH; META HEURISTICS; META-HEURISTIC APPROACH; MINIMUM MAKESPAN; NP-HARD PROBLEM; OPERATION SEQUENCES; OPTIMAL ALLOCATION; OPTIMAL PROCESS; OPTIMALITY; RESOURCE AVAILABILITY; ROUTINGS; SEQUENCING PROBLEMS;

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; HEURISTIC METHODS; MACHINERY; SCHEDULING ALGORITHMS;

ROUTING ALGORITHMS;

EID: 70449657251     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540701824845     Document Type: Article

References (33)

1. Bierwirth, C. and Mattfeld, D.C., 1999. Production scheduling and rescheduling with genetic algorithms. Evolutionary Computation, 7, 1-17.
2. Brandimarte, P., 1993. Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research, 41, 157-183.
3. Blum, C., 2003. An ant colony optimisation algorithm to tackle shop scheduling problems. Technical report TR/IRIDIA/2003-1, University Libre de Bruxelles, Brussels.
4. Candido, M.A.B., Khator, S.K., and Barcia, R.M., 1998. A genetic algorithm based procedure for more realistic job shop scheduling problems. International Journal of Production Research, 36, 3437-3457.
5. Choi, I.C. and Choi, D.S., 2002. A local search algorithm for job shop scheduling problems with alternative operations and sequence-dependent setups. Computers & Industrial Engineering, 42, 43-58.
6. Christoph, S.T., 2001. Job shop scheduling with alternative process plans. International Journal of Production Economics, 74, 125-134.
7. Colorni, A., Dorigo, M., Maniezzo, V., and Trubian, M., 1994. Ant system for job shop scheduling. JORBEL - Belgian Journal of Operations Research, Statistics and Computer Science, 34, 39-53.
8. Den Besten, M., Stützle, T. and Dorigo, M., 2000. An ant colony optimisation application to the single machine total weighted tardiness problem. In: M. Dorigo, M. Middendorf and T. Stützle, eds. Proceedings of ANTS'2000 from ant colonies to artificial ants: Second international workshop on ant algorithms, 7-9 September 2000, IRIDIA, Faculté des Sciences Appliqué es, Brussels, Belgium. Brussels: Université Libre de Bruxelles, 39-42.
9. Dorigo M., Colorni A. and Maniezzo V., 1992. An investigation of some properties of an ant algorithm, In: R. Manner and B. Manderick, eds. Proceedings of the conference on parallel problem solving from nature, 28-30 September 1992, Brussels, Belgium. Amsterdam: Elsevier, 509-520.
10. Dorigo, M. and Stützle, T., 1999. Ant colony algorithms for quadratic assignment problem: New ideas in optimisation. New York, NY: McGraw Hill.
11. Dorigo, M. and Stützle, T., 2005. Ant colony optimisation. India: Prentice Hall of India Pvt. Ltd.
12. Garey, M.R., Johnson, D.S., and Sethi, R., 1976. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1, 117-129.
13. Giffler, B. and Thompson, G.L., 1960. Algorithms for solving production scheduling problems. Operations Research, 8, 487-503.
14. Goldberg, D.E., 1989. Genetic algorithms in search, optimisation and machine learning. USA, MA: Addison-Wesley.
15. Hankins, S.L., Wysk, R.A., and Fox, K.R., 1984. Using a CATS database for alternative machine loading. Journal of Manufacturing Systems, 3, 115-120.
16. Hussain, M.F. and Joshi, S.B., 1998. A genetic algorithm for job shop scheduling problems with alternate routing. IEEE International Conference on Systems, Man and Cybernetics, 3, 2225-2230.
17. ILOG Solver - Reference Manual, version 2.0, 1994.
18. ILOG Schedule - Reference Manual, version 2.0, 1995.
19. Jawahar, N., Aravindan, P., and Ponnambalam, S.G., 1998. A genetic algorithm for scheduling flexible manufacturing systems. International Journal of Advanced Manufacturing Technology, 14, 588-607. (Pubitemid 128570937)
20. Jayaraman, V.K., Kulkarni, B.D., Karale, S., and Shalokar, P., 2000. Ant colony framework for optimal design and scheduling of batch plants. Computers and Chemical Engineering, 24, 1901-1912.
21. Kim, K.H. and Egbelu, P.J., 1999. Scheduling in a production environment with multiple process plans per job. International Journal of Production Research, 37, 2725-2753.
22. Kim, Y.K., Park, K., and Ko, J., 2003. A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling. Computers and Operations Research, 30, 1151-1171.
23. King, J.R., 1975. Production and planning control. Oxford, UK: Pergamon Press.
24. Michalewicz, Z., 1992. Genetic algorithms+data structures=evolution programs. Berlin/Heidelberg: Springer-Verlag.
25. Moon, J. and Lee, J., 2000. Genetic algorithm application to the job shop scheduling problem with alternative routing. Brain Korea 21 logistics team, Pusan National University.
26. Mastrolilli, M. and Gamberdella, L.M., 2000. Effective neighbourhood for the flexible job shop problem. Journal of Scheduling, 3 (1), 3-20.
27. McMullen, P.R., 2001. An ant colony optimisation approach to address a JIT sequencing problem with multiple objective. Artificial Intelligence in Engineering, 15, 309-317.
28. Nasr, N. and Elsayed, E.A., 1990. Job shop scheduling with alternative machines. International Journal of Production Research, 28, 1595-1609.
29. Pfahringer, B., 1996. Multi-agent search for open shop scheduling: Adapting the Ant-Q formalism. Technical report TR-96-109, Austrian Research Institute for Artificial Intelligence, Vienna.
30. Ponnambalam, S.G., Aravindan, P., and Sreenivasa Rao, P., 2001. Comparative evaluation of genetic algorithms for job-shop scheduling. Production Planning & Control, 12, 560-574.
31. Rajendran, C. and Ziegler, H., 2004. Ant-colony algorithms for permutation flowshop scheduling to minimise makespan/total flowtime of jobs. European Journal of Operational Research, 155, 426-438.
32. Stützle, T. and Hoos, H.H., 2000. Max-min ant system. Future Generation Computer Systems, 16, 889-914.
33. Wilhelm, W. and Shin, H., 1985. Effectiveness of alternative operations in a flexible manufacturing system. International Journal of Production Research, 23, 65-79.