A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates
A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates
The two-machine flow-shop sequencing problem with arbitrary release dates of jobs and the minimum makespan criterion is considered. The problem is known to be NP-hard, and the best-known approximation algorithms are those of Potts (Math. Oper. Res. 10 (1985) 576) with a worst-case performance ratio of 5/3 and running time O(n3 log n), and a polynomial time approximation scheme of Hall (Proceedings of the 36th Annual Symposium on Foundations of Computer Science, IEEE Comput. Soc. press, Los Alamitos, 1995, pp. 82–91.) that can generate solutions arbitrary close to the optimum but with a high-time requirement. In this paper, we modify Potts’ algorithm so that its worst-case performance ratio is reduced to 3/2, but its running time remains O(n3 log n).
scheduling, flow shop, release dates, approximation algorithm
255-271
Kashyrskikh, K.N.
3e414eca-100b-4411-a008-89ad72cd2b9d
Potts, C.N.
58c36fe5-3bcb-4320-a018-509844d4ccff
Sevastianov, S.V.
f16c8503-3696-4465-adb5-e0ff002c9ace
2001
Kashyrskikh, K.N.
3e414eca-100b-4411-a008-89ad72cd2b9d
Potts, C.N.
58c36fe5-3bcb-4320-a018-509844d4ccff
Sevastianov, S.V.
f16c8503-3696-4465-adb5-e0ff002c9ace
Kashyrskikh, K.N., Potts, C.N. and Sevastianov, S.V.
(2001)
A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates.
Discrete Applied Mathematics, 114 (1-3), .
(doi:10.1016/S0166-218X(00)00374-7).
Abstract
The two-machine flow-shop sequencing problem with arbitrary release dates of jobs and the minimum makespan criterion is considered. The problem is known to be NP-hard, and the best-known approximation algorithms are those of Potts (Math. Oper. Res. 10 (1985) 576) with a worst-case performance ratio of 5/3 and running time O(n3 log n), and a polynomial time approximation scheme of Hall (Proceedings of the 36th Annual Symposium on Foundations of Computer Science, IEEE Comput. Soc. press, Los Alamitos, 1995, pp. 82–91.) that can generate solutions arbitrary close to the optimum but with a high-time requirement. In this paper, we modify Potts’ algorithm so that its worst-case performance ratio is reduced to 3/2, but its running time remains O(n3 log n).
This record has no associated files available for download.
More information
Published date: 2001
Keywords:
scheduling, flow shop, release dates, approximation algorithm
Organisations:
Operational Research
Identifiers
Local EPrints ID: 29620
URI: http://eprints.soton.ac.uk/id/eprint/29620
ISSN: 0166-218X
PURE UUID: fe543227-450e-4fac-8cfd-c638b7b20dd6
Catalogue record
Date deposited: 11 May 2006
Last modified: 15 Mar 2024 07:33
Export record
Altmetrics
Contributors
Author:
K.N. Kashyrskikh
Author:
S.V. Sevastianov
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics