Maximizing throughput in some simple time-constrained scheduling situations


Huisman, H.H. and Polderman, G.L. and Weeda, P.J. (1990) Maximizing throughput in some simple time-constrained scheduling situations. Engineering Costs and Production Economics, 18 (35). pp. 293-299. ISSN 0167-188X

open access
[img] PDF
Abstract: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.
Item Type:Article
Copyright:© 1990 Elsevier
Research Group:
Link to this item:
Official URL:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page