Journal
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
Volume 64, Issue 1-3, Pages 127-141Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/S0925-5273(99)00052-3
Keywords
make-to-order production; assembly
Ask authors/readers for more resources
The problem of scheduling multiple, large-scale, make-to-order assemblies is considered. Beside 'classical' precedence and resource constraints as known from resource-constrained project scheduling we take spatial resource and part availability constraints into account. The objective is to minimize the sum of the weighted tardiness. We propose a MIP-model of the problem which is a generalization of three allocation problems. Since the problem is NP-hard, a list-scheduling heuristic is proposed and evaluated on a set of benchmark instances. (C) 2000 Elsevier Science B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available