A linear time algorithm to minimize maximum lateness for the two-machine, unit-time, job-shop, scheduling problem
| Autor(en): | Brucker, P. | Stichwörter: | Job shop scheduling; Flow shop scheduling; Dynamic priority scheduling; Algorithm; Tardiness; Due date; Scheduling (production processes); Computer science; Single-machine scheduling; Job scheduler; Schedule; Open-shop scheduling; Mathematical optimization; Rate-monotonic scheduling | Erscheinungsdatum: | 1982 | Herausgeber: | Springer, Berlin, Heidelberg | Startseite: | 566 | Seitenende: | 571 | DOI: | https://doi.org/10.1007/bfb0006180 |
Zur Langanzeige
