Sequencing Mixed-Model Assembly Lines to Minimize Part Inventory Cost
AbstractA mixed-model assembly line enables the joint production of dierent models of a common base product in intermixed model sequence (lot size one). Previous approaches for the short-term planning task of model sequencing either aim at minimizing work overload (mixed-model sequencing and car sequencing) or leveling part usages (level scheduling). However, at many manufacturers parts are consolidated by a third party logistics provider, who stocks Just-in-Time delivered parts in a consignment warehouse adjacent to the line. The manufacturer issues a complete cargo carrier (e.g. a euro-pallet) whenever his own intermediate storage of parts is depleted. Thus, the manufacturer aims at a model sequence which minimizes his own inventory costs. This paper formalizes this novel model sequencing problem and describes dierent heuristic and exact procedures. Furthermore, the solutions yielded by these approaches are compared to the traditional level scheduling.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Friedrich-Schiller-University Jena, School of Economics and Business Administration in its series Jena Research Papers in Business and Economics - Working and Discussion Papers with number 03/2007.
Date of creation: 25 Feb 2007
Date of revision:
Publication status: Published in: Operations Research Spectrum 30/3 (2008), 611-633
Postal: If a paper is not downloadable, please contact the author(s) or the library of University of Jena, not the archive maintainer.
This paper has been announced in the following NEP Reports:
- NEP-ALL-2007-04-09 (All new papers)
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Bautista, J. & Companys, R. & Corominas, A., 1996. "Heuristics and exact algorithms for solving the Monden problem," European Journal of Operational Research, Elsevier, vol. 88(1), pages 101-113, January.
- Nils Boysen & Erwin Pesch, 2008. "Scheduling freight trains in rail-rail transshipment yards," Jena Research Papers in Business and Economics - Working and Discussion Papers 11/2008, Friedrich-Schiller-University Jena, School of Economics and Business Administration.
- Malte Fliedner & Nils Boysen & Armin Scholl, 2007. "On the part inventory model sequencing problem: Complexity and beam search heuristic," Jena Research Papers in Business and Economics - Working and Discussion Papers 20/2007, Friedrich-Schiller-University Jena, School of Economics and Business Administration.
- Nils Boysen & Malte Fliedner & Armin Scholl, 2007. "Scheduling inbound and outbound trucks at cross docking terminals," Jena Research Papers in Business and Economics - Working and Discussion Papers 17/2007, Friedrich-Schiller-University Jena, School of Economics and Business Administration.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ().
If references are entirely missing, you can add them using this form.