TY - JOUR
T1 - Optimal scheduling of parallel machines with constrained resources
AU - Kogan, Konstantin
PY - 2006/5/1
Y1 - 2006/5/1
N2 - 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.
AB - 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.
KW - Constrained resources
KW - Scheduling
KW - Systems dynamics
UR - http://www.scopus.com/inward/record.url?scp=27744569918&partnerID=8YFLogxK
U2 - 10.1016/j.ejor.2004.05.021
DO - 10.1016/j.ejor.2004.05.021
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:27744569918
SN - 0377-2217
VL - 170
SP - 771
EP - 787
JO - European Journal of Operational Research
JF - European Journal of Operational Research
IS - 3
ER -