TY - JOUR
T1 - Maximizing throughput in some simple time-constrained scheduling situations
AU - Huisman, H.H.
AU - Polderman, G.L.
AU - Weeda, P.J.
PY - 1990
Y1 - 1990
N2 - This contribution focuses on some interesting phenomena occurring in scheduling capacity constrained resources in time-constrained situations. The scheduling situations considered form part of a simulation game developed to assist in teaching the scheduling philosophy of Optimized Production Technology (OPT) to production managers. It is shown that under certain conditions on set-up and processing times, advanced examples may be constructed combining three of the four complicating conditions mentioned m the OPT-literature. In addition, some interesting properties of process batches yielding a maximum throughput in such cases is considered.
AB - This contribution focuses on some interesting phenomena occurring in scheduling capacity constrained resources in time-constrained situations. The scheduling situations considered form part of a simulation game developed to assist in teaching the scheduling philosophy of Optimized Production Technology (OPT) to production managers. It is shown that under certain conditions on set-up and processing times, advanced examples may be constructed combining three of the four complicating conditions mentioned m the OPT-literature. In addition, some interesting properties of process batches yielding a maximum throughput in such cases is considered.
KW - IR-72628
U2 - 10.1016/0167-188X(90)90133-3
DO - 10.1016/0167-188X(90)90133-3
M3 - Article
VL - 18
SP - 293
EP - 299
JO - Engineering Costs and Production Economics
JF - Engineering Costs and Production Economics
SN - 0167-188X
IS - 35
ER -