𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal solution for a two-product dynamic scheduling problem in a just-in-time environment

✍ Scribed by Lyès Benyoucef; Yannick Frein; Bernard Penz

Book ID
108471227
Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
155 KB
Volume
74
Category
Article
ISSN
0925-5273

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A dynamic programming algorithm for sche
A dynamic programming algorithm for scheduling mixed-model, just-in-time production systems
✍ J. Miltenburg; G. Steiner; S. Yeomans 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 812 KB

## 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 b

Hybrid method for a general optimal sens
Hybrid method for a general optimal sensor scheduling problem in discrete time
✍ Z.G. Feng; K.L. Teo; V. Rehbock 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 566 KB

In this paper, we consider a general class of optimal sensor scheduling problems in discrete time. There are N 1 sensors available for acquiring data so as to estimate the needed but unknown signal. Only N 2 out of the N 1 sensors can be turned on at any moment, while different weights can be assign