An exact algorithm for the mixed-model level scheduling problem

Jordi Pereira and Mariona Vilà

International Journal of Production Research, 2015, vol. 53, issue 19, 5809-5825

Abstract: The Monden Problem, also known as the Output Rate Variation Problem, is one of the original formulations for mixed-model assembly line-level scheduling problems in a just-in-time system. In this paper, we develop a new branch-and-bound procedure for the problem that uses several new and previously proposed lower and upper bounds. The algorithm also includes several dominance rules that leverage the symmetry in the problem as well as a new labelling procedure that avoids repeated exploration of previously examined partial solutions. The branching strategy exploits the capabilities of current multiprocessor computers by exploring the search tree in a parallel fashion. The algorithm has been tested on several sets of instances from the literature and is able to optimally solve problems that are double the size of those addressed by other procedures previously reported in the literature.

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

Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2015.1005771 (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:19:p:5809-5825

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

DOI: 10.1080/00207543.2015.1005771

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 ().