Worst-case analysis of an approximation algorithm for flow-shop scheduling (Q1121778): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: A Heuristic Algorithm for the <i>n</i> Job, <i>m</i> Machine Sequencing Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Evaluation of Flow Shop Sequencing Heuristics / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Flowshop and Jobshop Schedules: Complexity and Approximation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(89)90045-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2001516562 / rank | |||
Normal rank | |||
Latest revision as of 10:34, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Worst-case analysis of an approximation algorithm for flow-shop scheduling |
scientific article |
Statements
Worst-case analysis of an approximation algorithm for flow-shop scheduling (English)
0 references
1989
0 references
worst-case analysis
0 references
m-machine permutation flow-shop problem
0 references
tight worst-case performance ratio
0 references
