A Note On The Complexity Of Openshop Scheduling Problems (Q3142313)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Note On The Complexity Of Openshop Scheduling Problems |
scientific article |
Statements
A Note On The Complexity Of Openshop Scheduling Problems (English)
0 references
15 November 1993
0 references
finish time
0 references
total weighted tardiness
0 references
maximum lateness
0 references
openshop scheduling
0 references
mean flow time in no-wait openshop
0 references
number of late jobs
0 references
preemptive schedules
0 references
NP-hard
0 references
