139
Views
20
CrossRef citations to date
0
Altmetric
Original Articles

An integrated model for inventory and production planning in a two-stage hybrid production system

Pages 4323-4339 | Published online: 14 Nov 2010

  • BAHL , C. 1983 . Column generation based heuristic for multi-item scheduling . AIIE Transactions , 15 : 136 – 141 .
  • BARANY , I. , VAN ROY , T. J. and WOLSEY , L. A. 1984 . Strong formulations for multi-item lot sizing . Management Science , 30 : 1255 – 1261 .
  • BITRAN , G. B. and YANASSE , H. H. 1982 . Computational complexity of the capacitated lot size problem . Management Science , 28 : 1174 – 1185 .
  • BROWN , R. G. 1967 . Decision Rules for Inventory Management , 46 – 55 . New York : Holt, Rinehart & Winston .
  • DIXON , P. and SILVER , E. 1981 . A heuristic solution procedure for the multi-item, single level, limited capacity, lot sizing problem . Journal of Operations Management , 2 : 23 – 39 .
  • DOGRAMACI , A. , PANAYIOTOPOULOS , J. and ADAM , N. 1981 . A dynamic lot sizing problem for multiple items under limited capacity . AIIE Transactions , 13 : 294 – 303 .
  • DOLL , C. L. and WHYBARK , D. C. 1973 . An iterative procedure for the single-machine multiproduct lot scheduling problem . Management Science , 20 : 50 – 55 .
  • DZIELINSKI , B. and GOMORY , R. 1965 . Optimal programming of lot sizes, inventories, and labor allocations . Management Science , 11 : 874 – 890 .
  • EPPEN , G. and MARTIN , R. 1987 . Multi-item capacitated lot sizing using variable redefinition . Operations Research , 35 : 832 – 848 .
  • EISENHUT , P. 1975 . A dynamic lot sizing algorithm with capacity constraints . AIIE Transactions , 7 : 170 – 176 .
  • FLORIAN , M. and KLEIN , M. 1971 . Deterministic production planning with concave costs and capacity constraints . Management Science , 18 : 12 – 20 .
  • HAX , A. C. and CANDEA , I. D. 1984 . Production and Inventory Management , Prentice Hall .
  • KARNI , R. and ROLL , Y. 1982 . A heuristic algorithm for multi-item lot sizing . AIIE Transactions , 14 : 249 – 256 .
  • LAMBRECHT , M. and VANDERVEKEN , H. 1979 . Heuristic procedures for the single operation multi-item loading problem . AIIE Transactions , 11 : 319 – 326 .
  • LASDON , L. and TERJUNG , R. 1971 . An efficient algorithm for multi-item scheduling . Operations Research , 19 : 946 – 969 .
  • LEUNG , J. , MAGNANTI , T. and VACHANI , R. 1989 . Facets and algorithms for capacitated lot sizing . Mathematical Programming , 43 : 331 – 359 .
  • MAES , J. and VAN WASSENHOVE , L. 1988 . Multi-item single-level dynamic lot-sizing heuristics: A general review . Journal of the Operational Research Society , 39 : 991 – 1004 .
  • MANNE , A. 1958 . Programming of economic lot sizes . Management Science , 4 : 115 – 135 .
  • MILLAR , H. H. and YANG , M. 1993 . An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem . Computers and Operations Research , 20 : 409 – 420 .
  • MILLAR , H. H. and YANG , M. 1994 . Lagrangean heuristics for the capacitated multi-item lot sizing problem with backordering . International Journal of Production Economics , 34 : 1 – 15 .
  • NEWSON , P. 1975 . Multi-item lot size scheduling by heuristic--Part 1: With fixed resources; Part II: With variable resources . Management Science , 21 : 1186 – 1193 . 1194 – 1203 .
  • THIZY , J. and VAN WASSENHOVE , L. 1985 . Lagrangean relaxation for multi-item capacitated lot sizing problem . AIIE Transactions , 17 : 308 – 313 .
  • VAN HOESEL , C. P. M. and WAGELMANS , A. P. M. 1996 . An O(T3) algorithm for the economic lot-sizing problem with constant capacities . Management Science , 42 : 142 – 150 .
  • VAN LANDEGHEM , H. , ed. 1997 . Computer Integrated Manufacturing in Belgic , 75 – 90 . Academia Press . (in Dutch)

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.