𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A dynamic programming algorithm for the single-machine scheduling problem with release dates and deteriorating processing times

✍ Scribed by Alberto Bosio; Giovanni Righini

Publisher
Springer
Year
2008
Tongue
English
Weight
461 KB
Volume
69
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A polynomial-time algorithm for the two-
A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
✍ Vadim G. Timkovsky πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 1014 KB

We consider a polynomial-time algorithm for the following scheduling problem: Given two machines, where each machine can process at most one job at a time; a set of jobs, where each job can start on or after its release date and consists of a chain of unit-time operations such that the machines have