A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times (Q1789013)
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 6949436
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times |
scientific article; zbMATH DE number 6949436 |
Statements
A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times (English)
0 references
9 October 2018
0 references
scheduling
0 references
flowshop
0 references
makespan
0 references
random and bounded processing times
0 references
setup times
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8854526877403259
0 references
0.8695583343505859
0 references
0.8535084128379822
0 references
0.8513752818107605
0 references
