472
Views
32
CrossRef citations to date
0
Altmetric
Original Articles

Batch versus cyclic scheduling of flexible flow shops by mixed-integer programming

Pages 5017-5034 | Received 03 May 2011, Accepted 20 Sep 2011, Published online: 26 Oct 2011

References

  • Abadi , INK , Hall , NG and Sriskandarajah , C . 2000 . Minimizing cycle time in a blocking flowshop . Operations Research , 48 ( 1 ) : 177 – 180 .
  • Braun , O . 2002 . Stability of Johnson's schedule with respect to limited machine availability . International Journal of Production Research , 40 ( 17 ) : 4381 – 4400 .
  • Che , A . 2011 . Multi-degree cyclic hoist scheduling with time window constraints . International Journal of Production Research , 49 ( 19 ) : 5679 – 5993 .
  • Hitz , KL . 1980 . Scheduling of flow shops II , Cambridge , , MA : Laboratory for Information and Decision Systems, MIT, LIDS-R-879 .
  • Johnson , SM . 1954 . Optimal two- and three-stage production schedules with setup times included . Naval Research Logistics Quarterly , 1 ( 1 ) : 61 – 68 .
  • Kaczmarczyk , W . 2004 . Optimal versus heuristic scheduling of surface mount technology lines . International Journal of Production Research , 42 ( 10 ) : 2083 – 2110 .
  • Karabati , S and Kouvelis , P . 1996 . Cycle scheduling in flow lines: Modeling observations, effective heuristics and a cycle time minimization procedure . Naval Research Logistics , 43 ( 3 ) : 211 – 231 .
  • Kis , T and Pesch , E . 2005 . A review of exact solution methods for the non-preemptive multiprocessor flowshop problem . European Journal of Operational Research , 164 ( 3 ) : 592 – 608 .
  • Kouvelis , P and Karabati , S . 1999 . Cyclic scheduling in synchronous production lines . IIE Transactions , 31 ( 8 ) : 709 – 719 .
  • Kubiak , W . 2002 . Two-machine flow shops with limited machine availability . European Journal of Operational Research , 136 ( 3 ) : 528 – 540 .
  • Kubzin , MA , Potts , CN and Strusevich , VA . 2009 . Approximation results for flow shop scheduling problems with machine availability constraints . Computers and Operations Research , 36 ( 2 ) : 379 – 390 .
  • Lee , C-Y . 2004 . “ Machine scheduling with availability constraints ” . In Handbook of scheduling , Edited by: Leung , JY-T . 22 – 113 . Boca Raton : CRC Press .
  • Levner , E . 2010 . Complexity of cyclic scheduling problems: A state-of-the-art survey . Computers and Industrial Engineering , 59 ( 2 ) : 352 – 361 .
  • Linn , R and Zhang , W . 1999 . Hybrid flowshop scheduling: A survey . Computers and Industrial Engineering , 37 ( 1/2 ) : 57 – 61 .
  • McCormick , ST . 1989 . Sequencing in an assembly line with blocking to minimize cycle time . Operations Research , 37 ( 6 ) : 925 – 936 .
  • Mendez , CA . 2006 . State-of-the-art review of optimization methods for short-term scheduling of batch processes . Computers and Chemical Engineering , 30 ( 6–7 ) : 913 – 946 .
  • Özlen , M and Webster , S . 2010 . Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs . International Journal of Production Research , 48 ( 1 ) : 201 – 226 .
  • Pinedo , M . 2005 . Planning and scheduling in manufacturing and services , New York : Springer .
  • Pinto , T , Barbosa-Povoa , APFD and Novais , AQ . 2005 . Optimal design and retrofit of batch plants with a periodic mode of operation . Computers and Chemical Engineering , 29 ( 6 ) : 1293 – 1303 .
  • Quadt , D and Kuhn , H . 2007 . A taxonomy of flexible flow line scheduling procedures . European Journal of Operational Research , 178 ( 3 ) : 686 – 698 .
  • Ribas , I , Leisten , R and Framinan , JM . 2010 . Review and classification of hybrid flowshop scheduling problems from a production system and a solutions procedure perspective . Computers and Operations Research , 37 ( 8 ) : 1439 – 1454 .
  • Ruiz , R and Vazquez-Rodriguez , JA . 2010 . The hybrid flow shop scheduling problem . European Journal of Operational Research , 205 ( 1 ) : 1 – 18 .
  • Sawik , T . 2000 . Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers . Mathematical and Computer Modelling , 31 ( 13 ) : 39 – 52 .
  • Sawik , T . 2001 . Mixed integer programming for scheduling surface mount technology lines . International Journal of Production Research , 39 ( 14 ) : 3219 – 3235 .
  • Sawik , T . 2002 . An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers . Mathematical and Computer Modelling , 36 ( 5 ) : 461 – 471 .
  • Schmidt , G . 2000 . Scheduling with limited machine availability . European Journal of Operational Research , 121 ( 1 ) : 1 – 15 .
  • Trautmann , N and Schwindt , C . 2009 . A cyclic approach to large-scale short-term planning in chemical batch production . Journal of Scheduling , 12 ( 6 ) : 595 – 606 .
  • Vignier , A , Billaut , JC and Proust , C . 1999 . Hybrid flowshop scheduling problems: State of the art . Rairo-Recherche Operationnelle – Operations Research , 33 ( 2 ) : 117 – 183 .
  • Wang , H . 2005 . Flexible flowshop scheduling: Optimum, heuristics and artificial intelligence solutions . Expert Systems , 22 ( 2 ) : 78 – 85 .
  • Winch , JK , Cai , X and Vairaktarakis , GL . 2007 . Cyclic job scheduling in paced assembly lines with cross-trained workers . International Journal of Production Research , 45 ( 4 ) : 803 – 828 .
  • Yan , P . 2010 . A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows . International Journal of Production Research , 48 ( 21 ) : 6461 – 6480 .
  • You , F , Castro , PM and Grossmann , IE . 2009 . Dinkelbach's algorithm as an efficient method to solve a class of MINLP models for large-scale cyclic scheduling problems . Computers and Chemical Engineering , 33 ( 11 ) : 1879 – 1889 .
  • Zandieh , M and Gholami , M . 2009 . An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns . International Journal of Production Research , 47 ( 24 ) : 6999 – 7027 .

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.