Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time (Q391321)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time |
scientific article; zbMATH DE number 6244158
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time |
scientific article; zbMATH DE number 6244158 |
Statements
Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time (English)
0 references
10 January 2014
0 references
single-machine scheduling
0 references
release time
0 references
maximum job lateness
0 references
binary search
0 references
0 references
