IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this paper

Sequencing Mixed-Model Assembly Lines to Minimize Part Inventory Cost

Listed author(s):
  • Nils Boysen


    (Universität Hamburg, Institut für Industrielles Management)

  • Malte Fliedner


    (Universität Hamburg, Institut für Industrielles Management)

  • Armin Scholl


    (University of Jena, Faculty of Economics)

A 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.

If 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.

File URL:
Download Restriction: no

Paper 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.

in new window

Date of creation: 25 Feb 2007
Publication status: Published in: Operations Research Spectrum 30/3 (2008), 611-633
Handle: RePEc:jen:jenjbe:2007-03
Contact details of provider: Postal:
Carl-Zeiss-Strasse 3, 07743 JENA

Phone: +049 3641/ 9 43000
Fax: +049 3641/ 9 43000
Web page:

More information through EDIRC

Order Information: Postal: If a paper is not downloadable, please contact the author(s) or the library of University of Jena, not the archive maintainer.

References listed on IDEAS
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.:

in new window

  1. 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.
Full references (including those not matched with items on IDEAS)

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

When requesting a correction, please mention this item's handle: RePEc:jen:jenjbe:2007-03. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ()

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.

This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.