The parallel machine min-max weighted absolute lateness scheduling problem (Q4279270)
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: The parallel machine min-max weighted absolute lateness scheduling problem |
scientific article; zbMATH DE number 502876
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The parallel machine min-max weighted absolute lateness scheduling problem |
scientific article; zbMATH DE number 502876 |
Statements
15 March 1995
0 references
NP-hard problem
0 references
earliness
0 references
tardiness
0 references
parallel machine min-max weighted absolute lateness problem
0 references
common due date
0 references
optimal non-preemptive job schedule
0 references
polynomial time heuristic
0 references
The parallel machine min-max weighted absolute lateness scheduling problem (English)
0 references
