On the complexity of preemptive openshop scheduling problems (Q1333531)
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: On the complexity of preemptive openshop scheduling problems |
scientific article; zbMATH DE number 639332
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of preemptive openshop scheduling problems |
scientific article; zbMATH DE number 639332 |
Statements
On the complexity of preemptive openshop scheduling problems (English)
0 references
15 September 1994
0 references
total weighted tardiness
0 references
maximum lateness
0 references
number of late jobs
0 references
preemptive openshop scheduling
0 references
mean flow time
0 references
NP-hard
0 references
0 references
