Scheduling algorithms for flexible flowshops: Worst and average case performance (Q583096)
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: Publication:583096 |
scientific article; zbMATH DE number 4131932
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling algorithms for flexible flowshops: Worst and average case performance |
scientific article; zbMATH DE number 4131932 |
Statements
Scheduling algorithms for flexible flowshops: Worst and average case performance (English)
0 references
1989
0 references
The problem to be considered is one of scheduling tasks in a flexible flowshop environment. It differs from the classical one by the existence of parallel machines at each stage of the flowshop system. Since the problem of finding a minimum length schedule is obviously NP-hard, the authors propose several heuristic algorithms for solving the problem. Then, their worst case as well as mean behaviors, are analyzed.
0 references
task scheduling
0 references
flexible flowshop
0 references
parallel machines at each stage
0 references
minimum length schedule
0 references
heuristic
0 references
worst case
0 references
mean behaviors
0 references
0 references
0.8544090390205383
0 references
0.8505448698997498
0 references
0.8491518497467041
0 references
0.8449995517730713
0 references
