Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling (Q1183390): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(91)90025-k / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1979770131 / rank | |||
Normal rank | |||
Latest revision as of 10:54, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling |
scientific article |
Statements
Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling (English)
0 references
28 June 1992
0 references
The permutation flow-shop scheduling problem is considered. As the problem is NP-hard, several heuristic algorithms for solving it have been already given in the literature. Here, a worst case analysis of one of these algorithms proposed by \textit{D. G. Dannenbring} [Manage. Sci. 23, 1174-1182 (1977; Zbl 0371.90063)] is analyzed and the ratio of \(m/\sqrt 2\) is given.
0 references
Dannenbring's algorithm
0 references
rapid access algorithm
0 references
approximation algorithm
0 references
permutation flow-shop scheduling
0 references
NP-hard
0 references
heuristic algorithms
0 references
worst case analysis
0 references
