𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs

✍ Scribed by Peter Brucker

Publisher
Springer
Year
1994
Tongue
German
Weight
289 KB
Volume
16
Category
Article
ISSN
0171-6468

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