575
Views
17
CrossRef citations to date
0
Altmetric
Research Articles

A hybrid general lot-sizing and scheduling formulation for a production process with a two-stage product structure

, , , &
Pages 2463-2480 | Accepted 01 Aug 2010, Published online: 18 Feb 2011

References

  • Burman , MH and Gershwin , SB . 1996 . A real-time dynamic lot-sizing heuristic for a manufacturing system subject to random setup times . International Journal of Production Research , 34 ( 6 ) : 1625 – 1641 .
  • Chen , VCP . 2006 . A review on design, modeling and applications of computer experiments . IIE Transactions , 38 ( 4 ) : 273 – 291 .
  • Clark , AR and Clark , JS . 2000 . Rolling-horizon lot-sizing when set-up times are sequence-dependent . International Journal of Production Research , 38 ( 10 ) : 2287 – 2307 .
  • Clark , AR and Clark , JS . 2010 . Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching . Journal of Scheduling , 13 ( 2 ) : 111 – 121 .
  • Denizel , M and Süral , H . 2006 . On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times . Journal of the Operational Research Society , 57 ( 4 ) : 389 – 399 .
  • Drexl , A and Kimms , A . 1997 . Lot sizing and scheduling–survey and extensions . European Journal of Operational Research , 99 ( 2 ) : 221 – 235 .
  • Eppen , GD and Martin , RK . 1987 . Solving multi-item capacitated lot-sizing problems using variable redefinition . Operations Research , 35 ( 6 ) : 832 – 848 .
  • Fleischmann , B . 1994 . The discrete lot-sizing and scheduling problem with sequence-dependent setup costs . European Journal of Operational Research , 75 ( 2 ) : 395 – 404 .
  • Fleischmann , B and Meyr , H . 1997 . The general lotsizing and scheduling problem . OR Spectrum , 19 ( 1 ) : 11 – 21 .
  • Floudas , CA and Lin , X . 2004 . Continuous-time versus discrete-time approaches for scheduling of chemical processes: a review . Computers and Chemical Engineering , 28 : 2109 – 2129 .
  • Grosso , A , Jamali , ARMJU and Locatelli , M . 2009 . Finding maximin latin hypercube designs by iterated local search heuristics . European Journal of Operational Research , 197 ( 2 ) : 541 – 547 .
  • Günther , H-O and Van Beek , P . 2003 . “ Advanced planning and scheduling in process industry ” . In Advanced planning and scheduling solutions in process industry , Edited by: Günther , H-O and Van Beek , P . 1 – 9 . Berlin : Springer .
  • Jans , RF and Degraeve , Z . 2008 . Modeling industrial lot sizing problems: A review . International Journal of Production Research , 46 ( 6 ) : 1619 – 1643 .
  • Jordan , C and Drexl , A . 1998 . Discrete lotsizing and scheduling by batch sequencing . Management Science , 44 ( 5 ) : 698 – 713 .
  • Kallrath , J . 2002 . Planning and scheduling in the process industry . OR Spectrum , 24 ( 3 ) : 219 – 250 .
  • Karimi , B , Fatemi Ghomi , SMT and Wilson , JM . 2003 . The capacitated lot sizing problem: a review of models and algorithms . Omega , 31 ( 5 ) : 365 – 378 .
  • Kimms , A and Motta Toledo , CF . 2003 . “ Bottling coca-cola soft drinks ” . In Technical report , Freiberg : Technical University Bergakademie .
  • Koçlar , A . 2005 . The general lot sizing and scheduling problem with sequence dependent changeovers , Master thesis Middle East Technical University .
  • Koçlar , A and Süral , H . 2005 . A note on The general lot sizing and scheduling problem . OR Spectrum , 27 ( 1 ) : 145 – 146 .
  • Krarup , J and Bilde , O . 1977 . “ Plant location, set covering and economic lotsizing: an O(mn) algorithm for structured problems ” . In Optimierung bei Graphentheoretischen und Ganzzahligen Problemen , Edited by: Collatz , L . 150 – 180 . Basel : Birkhäuser .
  • Lasdon , LS and Terjung , RC . 1971 . An efficient algorithm for multi-item scheduling . Operations Research , 19 ( 4 ) : 946 – 969 .
  • Lasserre , JB . 1992 . An integrated model for job-shop planning and scheduling . Management Science , 38 ( 8 ) : 1201 – 1211 .
  • Meyr , H . 2000 . Simultaneous lotsizing and scheduling by combining local search with dual reoptimization . European Journal of Operational Research , 120 ( 2 ) : 311 – 326 .
  • Meyr , H . 2002 . Simultaneous lotsizing and scheduling on parallel machines . European Journal of Operational Research , 139 ( 2 ) : 277 – 292 .
  • Pochet , Y and Wolsey , LA . 2006 . Production planning by mixed integer programming (Springer Series in Operations Research and Financial Engineering) , Secaucus, NJ, , USA : Springer-Verlag New York, Inc .
  • Rosling , K . 1986 . “ Optimal lot sizing for dynamic assembly systems ” . In Multi-Stage Production Planning and Inventory Control , Edited by: Axsäter , S , Schneeweiss , C and Silver , E . 119 – 131 . Heidelberg : Springer .
  • Salomon , M . 1997 . Solving the discrete lotsizing and scheduling problem with sequence dependent setup costs and set-up times using the travelling salesman problem with time windows . European Journal of Operational Research , 100 ( 3 ) : 494 – 513 .
  • Stadtler , H . 1996 . Mixed integer programming model formulations for dynamic multiitem multi-level capacitated lotsizing . European Journal of Operational Research , 94 ( 3 ) : 561 – 581 .
  • Sürie , C . 2005 . Time continuity in discrete time models , Berlin : Springer .
  • Sürie , C and Stadtler , H . 2003 . The capacitated lot-sizing problem with linked lot sizes . Management Science , 49 ( 8 ) : 1039 – 1054 .
  • Tempelmeier , H and Buschkühl , L . 2008 . Dynamic multi-machine lotsizing and sequencing with simultaneous scheduling of a common setup resource . International Journal of Production Economics , 113 ( 1 ) : 401 – 412 .

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.