Efficient methods for scheduling make-to-order assemblies under resource, assembly area and part availability constraints

R. Kolisch and K. Hess

International Journal of Production Research, 2000, vol. 38, issue 1, 207-228

Abstract: We consider the problem of scheduling multiple, large-scale, make-to-order assemblies under resource, assembly area, and part availability constraints. Such problems typically occur in the assembly of high-volume, discrete maketo-order products. Based on a list scheduling procedure proposed by Kolisch in 1999 we introduce three efficient heuristic solution methods. Namely, a biased random sampling method and two tabu search-based large-step optimization methods. The two latter methods differ in the employed neighbourhood. The first one uses a simple API-neighbourhood while the second one uses a more elaborated so-called 'critical neighbourhood' which makes use of problem insight. All three procedures are assessed on a systematically generated set of test instances. The results indicate that especially the large-step optimization method with the critical neighbourhood gives very good results which are significant better than simple single-pass list scheduling procedures.

Date: 2000
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/002075400189653 (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:38:y:2000:i:1:p:207-228

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

DOI: 10.1080/002075400189653

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