Efficient algorithms for flexible job shop scheduling with parallel machines (Q6093557)
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 7747008
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for flexible job shop scheduling with parallel machines |
scientific article; zbMATH DE number 7747008 |
Statements
Efficient algorithms for flexible job shop scheduling with parallel machines (English)
0 references
9 October 2023
0 references
absolute worst-case error bound
0 references
approximation algorithm
0 references
flexible job shop scheduling
0 references
makespan
0 references
0 references
0 references
0 references
0 references
0.8336507081985474
0 references
0.8265623450279236
0 references
0.8235484957695007
0 references
0.8189449310302734
0 references
