An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan (Q511693)
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: An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan |
scientific article; zbMATH DE number 6687845
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan |
scientific article; zbMATH DE number 6687845 |
Statements
An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan (English)
0 references
22 February 2017
0 references
job shop
0 references
makespan
0 references
batch machine
0 references
flexible machine
0 references
available constrain
0 references
0 references
0 references
0 references
0.8175930380821228
0 references
0.7810062170028687
0 references
0.7659356594085693
0 references
0.7577272653579712
0 references
0.7465450763702393
0 references
