Dynamic production scheduling
They are planning for unlimited resources. They only compute the resources needed and do not schedule jobs that need the same resource at different times.
They do not take bottle-necks into account.
They are most often planing on week basis.
They do not take into account the status on the shop floor (machine breakdown, order status etc)
They do not find the optimum sequence of jobs.
They are not fit for consequence analyses.
Unable to display preview. Download preview PDF.
- Goldratt, and J. Cox, The Goal, Scheduling Technology Group Limited, 1984.Google Scholar
- Guida, L. Majocchi and E. Moglia, “State of the Art of O.R. and A.I. Techniques For Scheduling”, Esprit 2434, 6 Months report, Supplement Bl, pp. 2–45, 1989.Google Scholar
- Hanan and J. M. Kurtzberg, “Placement Techniques”, Chap. 5 in Design Automation of Digital Systems: Theory and Techniques, Vol. 1 (Ed. M. A. Breuer) Prentice-Hall, N.J. (1972) pp. 213–282.Google Scholar
- M. Kaldager and S. Ulfsby, “Bottleneck Scheduling”, ESPRIT 2434, 12 month report, 1990.Google Scholar
- F. Wang and M. Rosenshine, “Scheduling For a Combination of Madeto-Stock and Made-to-Order Jobs in a Job Shop”, International Journal of Production Research, Vol. 21, No. 5 (Sept/Oct 1983), pp. 607–616.Google Scholar