A heuristic algorithm for two-machine re-entrant shop scheduling (Q1290158)
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: A heuristic algorithm for two-machine re-entrant shop scheduling |
scientific article; zbMATH DE number 1299357
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A heuristic algorithm for two-machine re-entrant shop scheduling |
scientific article; zbMATH DE number 1299357 |
Statements
A heuristic algorithm for two-machine re-entrant shop scheduling (English)
0 references
10 June 1999
0 references
two-machine re-entrant shop
0 references
maximum completion time
0 references
heuristic
0 references
worst-case performance ratio
0 references
0.8554440140724182
0 references
0.848716676235199
0 references
0.8397514224052429
0 references
0.8394837975502014
0 references
0.8359856009483337
0 references
