Journal article
A Lagrangean decomposition solution to a single line multiproduct scheduling problem
European journal of operational research, Vol.79(1), pp.25-37
11/24/1994
DOI: 10.1016/0377-2217(94)90393-X
Abstract
One of the major concerns in manufacturing is the cost and/or time of product changeovers on a production line. A changeover involves setting up the line to produce a different product. The problem of finding the schedule for producing products on a single level, capacitated line such that the best trade-off between changeover and inventory carrying costs is obtained can be complex. In this paper, we solve a mixed integer programming formulation of that problem utilizing Lagrangean decomposition for finding lower bounds, and a primal heuristic for generating feasible schedules from Lagrangean solutions. Compared to existing approaches, our procedure yields near optimum solutions to large problems faster.
Details
- Title: Subtitle
- A Lagrangean decomposition solution to a single line multiproduct scheduling problem
- Creators
- Renato de Matta - University of Iowa
- Resource Type
- Journal article
- Publication Details
- European journal of operational research, Vol.79(1), pp.25-37
- Publisher
- Elsevier B.V
- DOI
- 10.1016/0377-2217(94)90393-X
- ISSN
- 0377-2217
- eISSN
- 1872-6860
- Language
- English
- Date published
- 11/24/1994
- Academic Unit
- Business Analytics
- Record Identifier
- 9984380426302771
Metrics
2 Record Views