Scheduling algorithms for flexible flowshops: Worst and average case performance (Q583096): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(89)90208-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2050193551 / rank | |||
Normal rank | |||
Revision as of 23:03, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling algorithms for flexible flowshops: Worst and average case performance |
scientific article |
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
