289
Views
24
CrossRef citations to date
0
Altmetric
Original Articles

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

&
Pages 3891-3917 | Received 30 Oct 2006, Accepted 07 Nov 2007, Published online: 13 May 2009

References

  • Bierwirth , C and Mattfeld , DC . 1999 . Production scheduling and rescheduling with genetic algorithms . Evolutionary Computation , 7 : 1 – 17 .
  • Brandimarte , P . 1993 . Routing and scheduling in a flexible job shop by tabu search . Annals of Operations Research , 41 : 157 – 183 .
  • Blum , C . 2003 . An ant colony optimisation algorithm to tackle shop scheduling problems , Brussels : Technical report TR/IRIDIA/2003-1, University Libre de Bruxelles .
  • Candido , MAB , Khator , SK and Barcia , RM . 1998 . A genetic algorithm based procedure for more realistic job shop scheduling problems . International Journal of Production Research , 36 : 3437 – 3457 .
  • Choi , IC and Choi , DS . 2002 . A local search algorithm for job shop scheduling problems with alternative operations and sequence-dependent setups . Computers & Industrial Engineering , 42 : 43 – 58 .
  • Christoph , ST . 2001 . Job shop scheduling with alternative process plans . International Journal of Production Economics , 74 : 125 – 134 .
  • 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 .
  • 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 . 2000 , IRIDIA. Faculté des Sciences Appliquées, Brussels, Belgium. Brussels: Université Libre de Bruxelles, 39–42 7–9 September 2000
  • Dorigo , M , Colorni , A and Maniezzo , V . 28–30 September 1992 1992 . “ An investigation of some properties of an ant algorithm ” . In Proceedings of the conference on parallel problem solving from nature , Edited by: Manner , R and Manderick , B . 28–30 September 1992 , 509 – 520 . Brussels, Belgium. Amsterdam : Elsevier .
  • Dorigo , M and Stützle , T . 1999 . Ant colony algorithms for quadratic assignment problem: new ideas in optimisation , New York, NY : McGraw Hill .
  • Dorigo , M and Stützle , T . 2005 . Ant colony optimisation , India : Prentice Hall of India Pvt. Ltd .
  • Garey , MR , Johnson , DS and Sethi , R . 1976 . The complexity of flowshop and jobshop scheduling . Mathematics of Operations Research , 1 : 117 – 129 .
  • Giffler , B and Thompson , GL . 1960 . Algorithms for solving production scheduling problems . Operations Research , 8 : 487 – 503 .
  • Goldberg , DE . 1989 . Genetic algorithms in search, optimisation and machine learning , MA USA : Addison-Wesley .
  • Hankins , SL , Wysk , RA and Fox , KR . 1984 . Using a CATS database for alternative machine loading . Journal of Manufacturing Systems , 3 : 115 – 120 .
  • Hussain , MF and Joshi , SB . 1998 . A genetic algorithm for job shop scheduling problems with alternate routing . IEEE International Conference on Systems, Man and Cybernetics , 3 : 2225 – 2230 .
  • ILOG Solver – Reference Manual . 1994 . version 2.0
  • ILOG Schedule – Reference Manual . 1995 . version 2.0
  • Jawahar , N , Aravindan , P and Ponnambalam , SG . 1998 . A genetic algorithm for scheduling flexible manufacturing systems . International Journal of Advanced Manufacturing Technology , 14 : 588 – 607 .
  • Jayaraman , VK , Kulkarni , BD , Karale , S and Shalokar , P . 2000 . Ant colony framework for optimal design and scheduling of batch plants . Computers and Chemical Engineering , 24 : 1901 – 1912 .
  • Kim , KH and Egbelu , PJ . 1999 . Scheduling in a production environment with multiple process plans per job . International Journal of Production Research , 37 : 2725 – 2753 .
  • Kim , YK , 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 .
  • King , JR . 1975 . Production and planning control , Oxford, UK : Pergamon Press .
  • Michalewicz , Z . 1992 . Genetic algorithms + data structures = evolution programs , Berlin/Heidelberg : Springer-Verlag .
  • 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 .
  • Mastrolilli , M and Gamberdella , LM . 2000 . Effective neighbourhood for the flexible job shop problem . Journal of Scheduling , 3 ( 1 ) : 3 – 20 .
  • McMullen , PR . 2001 . An ant colony optimisation approach to address a JIT sequencing problem with multiple objective . Artificial Intelligence in Engineering , 15 : 309 – 317 .
  • Nasr , N and Elsayed , EA . 1990 . Job shop scheduling with alternative machines . International Journal of Production Research , 28 : 1595 – 1609 .
  • Pfahringer , B . 1996 . Multi-agent search for open shop scheduling: adapting the Ant-Q formalism. Technical report TR-96-09 , Vienna : Austrian Research Institute for Artificial Intelligence .
  • Ponnambalam , SG , Aravindan , P and Sreenivasa Rao , P . 2001 . Comparative evaluation of genetic algorithms for job-shop scheduling . Production Planning & Control , 12 : 560 – 574 .
  • 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 .
  • Stützle , T and Hoos , HH . 2000 . Max-min ant system . Future Generation Computer Systems , 16 : 889 – 914 .
  • Wilhelm , W and Shin , H . 1985 . Effectiveness of alternative operations in a flexible manufacturing system . International Journal of Production Research , 23 : 65 – 79 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.