Optimal Cycle Times in Multistage Serial Systems with Set-Up and Inventory Costs

Iftekhar A. Karimi
Additional contact information
Iftekhar A. Karimi: Department of Chemical Engineering, Northwestern University, Evanston, Illinois 60208-3120

Management Science, 1992, vol. 38, issue 10, 1467-1481

Abstract: Scheduling of multistage serial production systems under constant demand and infinite horizon is considered. The production stages operate with periodic shut-downs and startups. An integer nonlinear programming formulation is presented for determining a stationary, cyclic schedule with no stock-outs in any inventory and minimum sum of set-up and inventory costs. It allows a lot-sizing policy involving arbitrary, noninteger splitting/merging of lots. Three, almost optimal, heuristic algorithms and an exact branch and bound algorithm are developed using analytical results. Their evaluation using simulated problems shows the branch and bound algorithm to be the best, as it is fast even for systems with as many as 11 stages.

Keywords: inventory/production; deterministic models; production/scheduling; flow shop; inventory/production; multistage lot sizing (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.38.10.1467 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:38:y:1992:i:10:p:1467-1481

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().