589
Views
39
CrossRef citations to date
0
Altmetric
Original Articles

A GRASP algorithm for flexible job-shop scheduling with maintenance constraints

, &
Pages 6821-6836 | Received 15 Jul 2009, Accepted 18 Aug 2009, Published online: 18 Jan 2010

References

  • Aggoune , R . 2006 . Minimizing the makespan for the flow shop scheduling problem with availability constraints . European Journal of Operational Research , 153 ( 3 ) : 534 – 543 .
  • Aggoune , R and Portmann , MC . 2006 . Flow shop scheduling problem with limited machine availability: a heuristic approach . International Journal of Production Economics , 99 ( 1 ) : 4 – 15 .
  • Aiex , RM , Binato , S and Resende , GC . 2003 . Parallel GRASP with path-relinking for job shop scheduling . Parallel Computing , 29 ( 4 ) : 393 – 430 .
  • Allaoui , H and Artiba , A . 2006 . Scheduling two-stage hybrid flow shop with availability . Computers & Operations Research , 33 ( 5 ) : 1399 – 1419 .
  • Allaoui , H . 2008 . Simultaneously scheduling n jobs and the preventive maintenance on the two-machine flow shop to minimize the makespan . International Journal of Production Economics , 112 ( 1 ) : 161 – 167 .
  • Allaoui , H and Artiba , A . 2009 . Johnson's algorithm: a key to solve optimally or approximately flow shop scheduling problems with unavailability periods . International Journal of Production Economics , 121 ( 1 ) : 81 – 87 .
  • Arguello , MF and Bard , JF . 1997 . A GRASP for aircraft routing in response to groundings and delays . Journal of Combinatorial Optimization , 1 ( 3 ) : 211 – 228 .
  • Bard , JF , Venkatraman , K and Feo , TA . 1995 . Single machine scheduling with flow time and earliness penalties . Journal of Global Optimization , 3 ( 1 ) : 289 – 309 .
  • Breit , J . 2001 . Two-machine open shop scheduling with an availability constraint . Operation Research Letters , 29 ( 1 ) : 65 – 77 .
  • Chen , FTS , Wong , TC and Chen , LY . 2006 . Flexible job-shop scheduling problem under resource constraints . International Journal of Production Research , 44 ( 11 ) : 2071 – 2089 .
  • Corberan , A , Marti , R and Sanchis , JM . 2002 . A GRASP heuristic for the mixed Chinese postman problem . European Journal of Operational Research , 142 ( 1 ) : 70 – 80 .
  • Feo , TA and Resende , GC . 1995 . Greedy randomized adaptive search procedures . Journal of Global Optimization , 6 ( 1 ) : 109 – 133 .
  • Gao , J , Gen , M and Sun , L . 2006 . Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm . Journal of Intelligent Manufacturing , 17 ( 4 ) : 493 – 507 .
  • Gupta , SR and Smith , JS . 2006 . Algorithms for single machine total tardiness scheduling with sequence dependent setups . European Journal of Operational Research , 175 ( 2 ) : 722 – 739 .
  • Kacem , I , Hammadi , S and Borne , P . 2002a . Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic . Mathematics and Computers in Simulation , 60 ( 4 ) : 245 – 276 .
  • Kacem , I , Hammadi , S and Pierre , B . 2002b . Approach by localization and multi-objective evolutionary optimization for flexible job-shop scheduling problems . IEEE Transactions Systems Man and Cybernetics , 32 ( 1 ) : 1 – 13 .
  • Lee , CY . 1997 . Minimizing the makespan in two-machine flow shop scheduling with availability constraint . Operations Research Letters , 20 ( 1 ) : 129 – 139 .
  • Lee , CY . 1999 . Two machine flow shop scheduling with availability constraints . European Journal of Operational Research , 114 ( 2 ) : 420 – 429 .
  • Lee , CY and Chen , ZL . 2000 . Scheduling jobs and maintenances on parallel machines . Navel Research Logistics , 47 ( 1 ) : 145 – 165 .
  • Liouane , N . 2007 . Ant systems & local search optimization for flexible job shop scheduling production . International Journal of Computers Communications and Control , 2 ( 2 ) : 174 – 184 .
  • Naderi , B , Zandieh , M and Fatemi Ghomi , SMT . 2009 . Scheduling sequence dependent setup time job shops with preventive maintenance . International Journal of Advanced Manufacturing and Technology , 43 ( 1–2 ) : 170 – 181 .
  • Nozha , Z and Borne , P . Hybrid genetic algorithm for the flexible job shop problem under maintenance constraints . Proceedings of the international conference on advances in natural computation (ICNC 2005) . 27–29 August , Changsha, China. pp. 259 – 268 . Berlin : Springer .
  • Prabhaharan , G , Shahul Hamid Khan , B and Rakesh , L . 2006 . Implementation of GRASP in flow shop scheduling . International Journal of Advanced Manufacturing and Technology , 30 ( 11–12 ) : 1126 – 1131 .
  • Resende , GC . 1998 . Computing approximate solutions of the maximum covering problem using GRASP . Journal of Heuristics , 4 ( 1 ) : 161 – 171 .
  • Resende, G.C. and Ribeiro, C.C., 1998. Greedy Randomised Adaptive Search Procedures (GRASP). Technical Report, AT&T Labs Research, Florham Park, NJ 07932 USA, pp. 119–249
  • Saidi , M and Fattahi , P . 2007 . Flexible job shop scheduling with tabu search algorithms . International Journal of Advanced Manufacturing Technology , 32 ( 6 ) : 563 – 570 .
  • Schmidt , G . 2000 . Scheduling with limited machine availability . European Journal of Operational Research , 121 ( 1 ) : 1 – 15 .
  • Xia , W and Wu , Z . 2005 . An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems . Computers and Industrial Engineering , 48 ( 2 ) : 409 – 425 .
  • Xing , L . 2008 . Knowledge based ant colony optimization for the flexible job shop scheduling problems . Dynamics of Continuous, Discrete and Impulsive Systems Series B: Applications & Algorithms , 15 : 431 – 446 .
  • Zhang , G . 2009 . An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem . Computers and Industrial Engineering , 56 ( 4 ) : 1309 – 1318 .
  • Zhang , H and Gen , M . 2005 . Multistage-based genetic algorithm for flexible job shop scheduling problem . Complexity International , 11 ( 2 ) : 223 – 232 .

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.