𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Feasibility of scheduling lot sizes of two frequencies on one machine

✍ Scribed by Celia A. Glass

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
711 KB
Volume
75
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A polynomial algorithm for lot-size sche
A polynomial algorithm for lot-size scheduling of two type tasks
✍ Mikhail Y. Kovalyov; Marcus Pattloch; GΓΌnter Schmidt πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 94 KB

We study the problem of scheduling unit time tasks of two types on m parallel identical machines. For each type, given numbers of tasks are required to be completed by the specified deadlines. These tasks leave the system at the deadlines. The in-process inventory capacities are given. The objective