1,163
Views
46
CrossRef citations to date
0
Altmetric
Original Articles

A GRASP algorithm for flexible job-shop scheduling problem with limited resource constraints

, , &
Pages 2409-2423 | Received 03 Feb 2010, Accepted 12 Feb 2010, Published online: 06 May 2010

References

  • Aggoune , R . 2004 . Minimising the makespan for the flow shop scheduling problem with availability constraints . European Journal of Operational Research , 153 ( 3 ) : 534 – 543 .
  • 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 . 2008 . Simultaneously scheduling n jobs and the preventive maintenance on the two machine flow shop to minimise the makespan . International Journal of Production Economics , 112 ( 1 ) : 161 – 167 .
  • Allaoui , H and Artiba , A . 2006 . Scheduling two-stage hybrid flow shop with availability . Computers & Operations Research , 33 ( 5 ) : 1399 – 1419 .
  • 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 Optimisation , 5 ( 3 ) : 211 – 228 .
  • Bard , JF , Venkatraman , K and Feo , TA . 1995 . Single machine scheduling with flow time and earliness penalties . Journal of Global Optimisation , 3 ( 3 ) : 289 – 309 .
  • Brandimarte , P . 1993 . Routing and scheduling in a flexible job shop by taboo search . Annals of Operations Research , 41 ( 3 ) : 157 – 183 .
  • Chen , S , Wong , C 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 , M . 2002 . A GRASP heuristic for the mixed Chinese postman problem . European Journal of Operational Research , 142 ( 1 ) : 70 – 80 .
  • Du , X , Li , Z and Xing , W . 2008 . “ Flexible job shop scheduling problem based on genetic algorithm with model constraints ” . In In: Proceedings of the 2008 IEEE IEEM, 8–11 December 2008 , 1239 – 1243 . Singapore : IEEE .
  • Ehram , S , Seyed , J and Kamran , S . 2010 . Scheduling flow shops with condition-based maintenance constraint to minimise expected makespan . International Journal of Advanced Manufacturing Technology , 46 ( 5–8 ) : 757 – 767 .
  • Erricos , JK . 2006 . Handbook of parallel computing and statistics , Boca Raton, FL : Chapman and Hall/CRC Press .
  • Feo , TA and Resende , GC . 1995 . Greedy randomised adaptive search procedures . Journal of Global Optimisation , 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 .
  • Gendrean , M and Potvin , J . 2005 . Metaheuristics in combinatorial optimisation . Annals of Operations Research , 140 ( 1 ) : 189 – 213 .
  • 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 .
  • Jenson , M . 2003 . Generating robust and flexible job shop schedules using genetic algorithms . IEEE Transactions on Evolutionary Computation , 7 ( 3 ) : 275 – 288 .
  • Joachim , B . 2007 . Improved approximation for non-preemptive single machine flow time scheduling with an availability constraint . European Journal of Operational Research , 183 ( 2 ) : 516 – 524 .
  • Kacem , I , Hammadi , S and Borne , P . 2002 . Pareto-optimality approach for flexible job-shop scheduling problems: hybridisation of evolutionary algorithms and fuzzy logic . Mathematics and Computers in Simulation , 60 ( 4 ) : 245 – 276 .
  • Leon , J and Wu , S . 1992 . On scheduling with ready-times, due-dates and vacations . Naval Research Logistics , 39 ( 1 ) : 53 – 65 .
  • Liouane , N . 2007 . Ant systems and local search optimisation for flexible Job Shop Scheduling Production . International Journal of Computers Communications and Control , 2 ( 2 ) : 174 – 184 .
  • Liu, H., et al., 2006. Variable neighbourhood particle swarm optimization for multi-objective flexible job shop scheduling problems. SEAL 2006. Berlin Heidelberg: Springer-Verlag, 197–204.
  • Nozha , Z and Borne , P . 2005 . Hybrid genetic algorithm for the flexible job shop problem under maintenance constraints . In: Proceedings of the international conference on advances in natural computation (ICNC 2005) . 27–29 August 2005 , Changsha , China. pp. 259 – 268 . Berlin : Springer .
  • Parviz , F , Saidi , M and Jolai , F . 2007 . Mathematical modeling and heuristic approaches to flexible job shop scheduling problems . Journal of Intelligent Manufacturing , 18 ( 3 ) : 331 – 342 .
  • Prabhaharan , G , Shahul , B and Rakesh , L . 2006 . Implementation of grasp in flow shop scheduling . International Journal of Advanced Manufacturing and Technology , 30 ( 11–12 ) : 1126 – 1131 .
  • Qi , X , Chen , T and Tu , F . 1999 . Scheduling the maintenance on a single machine . Journal of the Operational Research Society , 50 ( 10 ) : 1071 – 1078 .
  • Rajkumar , M , Asokan , P and Vamsikrishna , V . 2010 . A GRASP algorithm for flexible job-shop scheduling with maintenance constraints . International Journal of Production Research , DOI: 10.1080/00207540903308969
  • Resende , GC . 1998 . Computing approximate solutions of the maximum covering problem using GRASP . Journal of Heuristics , 4 ( 1 ) : 161 – 171 .
  • Resende , GC and Ribeiro , CC . 1998 . “ Greedy randomised adaptive search procedures (GRASP) ” . Technical Report Florham Park, NJ, 07932 , , USA : AT&T Labs Research .
  • Saidi , M and Fattahi , P . 2007 . Flexible job shop scheduling with tabu search algorithms . International Journal of Advanced Manufacturing Technology , 32 ( 5–6 ) : 563 – 570 .
  • Schmidt , G . 1984 . Scheduling on semi-identical processors . Mathematical Methods of Operations Research , 28 ( 5 ) : 153 – 162 .
  • Schmidt , G . 2000 . Scheduling with limited machine availability . European Journal of Operational Research , 121 ( 1 ) : 1 – 15 .
  • Vilcot , G and Billaut , J . 2008 . A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem . European Journal of Operational Research , 190 ( 2 ) : 398 – 411 .
  • Xia , W and Wu , Z . 2005 . An effective hybrid optimisation approach for multi objective flexible job-shop scheduling problems . Computers and Industrial Engineering , 48 ( 2 ) : 409 – 425 .
  • Xing , L . 2009 . A knowledge based ant colony optimisation for flexible job shop scheduling problems . Applied Soft Computing , 10 ( 3 ) : 888 – 896 .
  • Zandieh , M , Mahdavi , I and Bagheri , A . 2008 . Solving the flexible job shop scheduling problem by a genetic algorithm . Journal of Applied Sciences , 8 ( 24 ) : 4650 – 4655 .
  • Zhang , G . 2009 . An effective hybrid particle swarm optimisation algorithm for multi-objective flexible job shop scheduling problems . 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.