Dynamic resequencing at mixed-model assembly lines

Christian Franz, Achim Koberstein and Leena Suhl

International Journal of Production Research, 2015, vol. 53, issue 11, 3433-3447

Abstract: In this paper, we investigate a dynamic resequencing problem covering realistic properties of a mixed-model assembly line. To this end, we present a mathematical model that addresses dynamically supplied blocking information and viable due dates. We developed two different strategies that use a static resequencing algorithm as a subroutine. One strategy integrates each unblocked order immediately into the planned sequence, whereas the other strategy waits for good positions that do not conflict with the due dates. All algorithms construct guaranteed feasible sequences. Using industrial test data, we show that both strategies perform significantly better than a simple method derived from practice. A replanning procedure that tries to improve the current planned sequence whenever computing time suffices yields an additional improvement for both strategies.

Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2014.993046 (text/html)
Access to full text is restricted to subscribers.

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:taf:tprsxx:v:53:y:2015:i:11:p:3433-3447

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TPRS20

DOI: 10.1080/00207543.2014.993046

Access Statistics for this article

International Journal of Production Research is currently edited by Professor A. Dolgui

More articles in International Journal of Production Research from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().