A dynamic programming algorithm for scheduling mixed-model, just-in-time production systems
β Scribed by J. Miltenburg; G. Steiner; S. Yeomans
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 812 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0895-7177
No coin nor oath required. For personal study only.
β¦ Synopsis
A dynamic programming
procedure for determining the optimal just-in-time (JIT) production schedule for a mixed-model facility is presented. Compared to previously available optimization methods it substantially reduces computation and storage requirements, enabling practical-sized problems to be solved. However, there are still difficulties for solving very large problems. Heuristics, which have been proposed
for these large problems, can now be evaluated by generating problems and comparing the schedules produced by the heuristics with the optimal schedule. This is done for two heuristics.
π SIMILAR VOLUMES
A time domain input estimation algorithm for linear systems with general time-varying parameters is developed. The algorithm is an extension of an existing approach for time-invariant state space models and several new features, such as higher order input approximations and an extended time-variant