On the part inventory model sequencing problem: Complexity and beam search heuristic

Malte Fliedner, Nils Boysen () and Armin Scholl ()
Additional contact information
Nils Boysen: School of Economics and Business Administration, Friedrich-Schiller-University Jena

No 20/2007, Jena Research Papers in Business and Economics - Working and Discussion Papers (Expired!) from Friedrich Schiller University Jena, School of Economics and Business Administration

Abstract: In many industries mixed-model assembly systems are increasingly supplied out of third-party consignment stock. This novel trend gives rise to a new short-term sequencing problem which decides on the succession of models launched down the line and aims at minimizing the cost of in-process inventory held by the manufacturer. In this work, we investigate the mathematical structure of this part oriented mixed-model sequencing problem and prove that general instances of the problem are NP-hard in the strong sense. Moreover, we develop a new Beam Search heuristic, which clearly outperforms existing solution procedures.

Keywords: Mixed-model assembly line; Sequencing; Consignment Stock; NP-hardness (search for similar items in EconPapers)
Date: 2007
References: Add references at CitEc
Citations:

Published in: Journal of Scheduling 14 (2011), 17-25.

Downloads: (external link)
http://dx.doi.org/10.1007/s10951-010-0214-9 (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:jen:jenjbe:2007-20

Access Statistics for this paper

More papers in Jena Research Papers in Business and Economics - Working and Discussion Papers (Expired!) from Friedrich Schiller University Jena, School of Economics and Business Administration
Bibliographic data for series maintained by Markus Pasche ().