Scheduling a single batch processing machine with non-identical job sizes (Q4394297)
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 1162756
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling a single batch processing machine with non-identical job sizes |
scientific article; zbMATH DE number 1162756 |
Statements
Scheduling a single batch processing machine with non-identical job sizes (English)
0 references
11 June 1998
0 references
total completion time
0 references
NP-hard
0 references
heuristics
0 references
branch-and-bound
0 references
0.8898476958274841
0 references
0.8826320171356201
0 references
0.8704030513763428
0 references
0.8680742979049683
0 references
0.8664391040802002
0 references
