Heuristics for short route job shop scheduling problems (Q1298692)
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 1326462
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristics for short route job shop scheduling problems |
scientific article; zbMATH DE number 1326462 |
Statements
Heuristics for short route job shop scheduling problems (English)
0 references
18 January 2000
0 references
approximation algorithm
0 references
NP-hard job shop scheduling
0 references
makespan
0 references
heuristic
0 references
worst-case ratio
0 references
0.8618631958961487
0 references
0.8383601903915405
0 references
0.8344591856002808
0 references
