Note: Open-shop scheduling with release dates to minimize maximum lateness (Q4698134)
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: Note: Open-shop scheduling with release dates to minimize maximum lateness |
scientific article; zbMATH DE number 754945
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Note: Open-shop scheduling with release dates to minimize maximum lateness |
scientific article; zbMATH DE number 754945 |
Statements
14 May 1995
0 references
polynomial-time algorithm
0 references
open-shop problem
0 references
arbitrary release dates
0 references
due dates
0 references
maximum lateness
0 references
Note: Open-shop scheduling with release dates to minimize maximum lateness (English)
0 references
