743
Views
59
CrossRef citations to date
0
Altmetric
Original Articles

Genetic algorithm for job-shop scheduling with machine unavailability and breakdowns

, &
Pages 4999-5015 | Received 16 Oct 2009, Accepted 05 May 2010, Published online: 25 Nov 2010

References

  • Aarts , EHL . 1994 . A computational study of local search algorithms for job shop scheduling . ORSA Journal on Computing , 6 ( 2 ) : 118 – 125 .
  • Abumaizar , RJ and Svestka , JA . 1997 . Rescheduling job shops under random disruptions . International Journal of Production Research , 35 ( 7 ) : 2065 – 2082 .
  • Adams , J , Balas , E and Zawack , D . 1988 . The shifting bottleneck procedure for job shop scheduling . Management Science , 34 ( 3 ) : 391 – 401 .
  • Baker , KR and Peterson , DW . 1979 . An analytic framework for evaluating rolling schedules . Management Science , 25 ( 4 ) : 341 – 351 .
  • Binato , S . 2001 . “ A GRASP for job shop scheduling ” . In Essays and surveys on metaheuristics , Edited by: Ribeiro , C and Hansen , P . 58 – 79 . Boston, MA : Kluwer Academic .
  • Blackstone , JH Jr. , Phillips , DT and Hogg , GL . 1982 . A state-of-the-art survey of dispatching rules for manufacturing job shop operations . International Journal of Production Research , 20 ( 1 ) : 27
  • Dorndorf , U and Pesch , E . 1995 . Evolution based learning in a job shop scheduling environment . Computers & Operations Research , 22 ( 1 ) : 25 – 40 .
  • Fahmy , SA , Balakrishnan , S and ElMekkawy , TY . 2008 . A generic deadlock-free reactive scheduling approach . International Journal of Production Research , 46 ( 1 ) : 1 – 20 .
  • Hasan , SMK . 2009 . Memetic algorithms for solving job-shop scheduling problems . Memetic Computing , 1 ( 1 ) : 69 – 83 .
  • Lawrence , D . 1985 . Job shop scheduling with genetic algorithms . First international conference on genetic algorithms. 1985 . pp. 136 – 140 . Mahwah, NJ : Lawrence Erlbaum Associates .
  • Liu , S , Ong , H and Ng , K . 2005 . Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem . Advances in Engineering Software , 36 ( 3 ) : 199 – 205 .
  • McKay , KN , Buzacot , JA and Safayeni , FR . 1989 . “ The scheduler's knowledge of uncertainty: The missing link ” . In Knowledge based production management systems , Amsterdam : Elsevier .
  • Mehta , S and Uzsoy , R . 1998 . Predictable scheduling of a job shop subject to breakdowns . IEEE Transactions on Robotics and Automation , 14 ( 3 ) : 365 – 378 .
  • Nakano , R and Yamada , T . 1991 . Conventional genetic algorithm for job shop problems . Fourth international conference on genetic algorithms. 1991 . Edited by: Booker , BA . pp. 474 – 479 . San Mateo, CA : Morgan Kaufmann .
  • O'Donovan , R , Uzsoy , R and McKay , KN . 1999 . Predictable scheduling of a single machine with breakdowns and sensitive jobs . International Journal of Production Research , 37 ( 18 ) : 4217 – 4233 .
  • Ombuki , BM and Ventresca , M . 2004 . Local search genetic algorithms for the job shop scheduling problem . Applied Intelligence , 21 ( 1 ) : 99 – 109 .
  • Pezzella , F , Morganti , G and Ciaschetti , G . 2008 . A genetic algorithm for the flexible Job-shop Scheduling Problem . Computers & Operations Research , 35 ( 10 ) : 3202 – 3212 .
  • Storer , RH , Wu , SD and Vaccari , R . 1992 . New search spaces for sequencing problems with application to job shop scheduling . Management Science , 38 ( 10 ) : 1495 – 1509 .
  • Subramaniam , V , Raheja , AS and Reddy , KRB . 2005 . Reactive repair tool for job shop schedules . International Journal of Production Research , 43 ( 1 ) : 1 – 23 .
  • Wu , SD , Storer , RH and Pei-Chann , C . 1993 . One-machine rescheduling heuristics with efficiency and stability as criteria . Computers & Operations Research , 20 ( 1 ) : 1 – 14 .

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.