On the Complexity of Scheduling with Batch Setup Times (Q4205231)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4125191
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Complexity of Scheduling with Batch Setup Times |
scientific article; zbMATH DE number 4125191 |
Statements
On the Complexity of Scheduling with Batch Setup Times (English)
0 references
1989
0 references
practical scheduling
0 references
batch setup times
0 references
one-machine maximum lateness
0 references
total weighted completion time
0 references
maximum completion time
0 references
parallel machines
0 references
0.8949333429336548
0 references
0.8589716553688049
0 references
0.8581360578536987
0 references
0.8553255200386047
0 references
