𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs

✍ Scribed by E. L. Lawler

Book ID
112718211
Publisher
Springer US
Year
1990
Tongue
English
Weight
358 KB
Volume
26
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Single machine scheduling to minimize th
Single machine scheduling to minimize the number of late jobs under uncertainty
✍ Shao Chin Sung; Milan Vlach πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 227 KB

In this paper, we deal with the problem of sequencing a ΓΏnite number of jobs for processing by a single machine with the objective of minimizing the number of jobs that are not completed by their due dates. We propose a rather general model based on an algebraic approach. By specifying suitable bina