Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 170, Issue 3, Pages 771-787Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2004.05.021
Keywords
scheduling; systems dynamics; constrained resources
Ask authors/readers for more resources
This paper analyzes a manufacturing system consisting of parallel machines, which produce one product-type with controllable production rates subject to continuously-divisible, time-dependent resources. The objective is to produce the required amount of product-type units by a due date while minimizing inventory, backlog and production related costs over a production horizon. With the aid of the maximum principle, a number of analytical rules of the optimal scheduling is derived whereby the continuous-time scheduling is reduced to discrete sequencing and timing. As a result, a polynomial-time algorithm is developed for solving the problem. (c) 2004 Elsevier 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