Heuristics for two-machine no-wait flowshop scheduling with an availability constraint

Authors
Wang, GQ Cheng, TCE
Citation
Gq. Wang et Tce. Cheng, Heuristics for two-machine no-wait flowshop scheduling with an availability constraint, INF PROCESS, 80(6), 2001, pp. 305-309
Citations number
10
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
INFORMATION PROCESSING LETTERS
ISSN journal
00200190 → ACNP
Volume
80
Issue
6
Year of publication
2001
Pages
305 - 309
Database
ISI
SICI code
0020-0190(200112)80:6<305:HFTNFS>2.0.ZU;2-M
Abstract
In this paper we study the two-machine no-wait flowshop problem with an ava ilability constraint. The problem has been shown to be NP-hard. and some he uristics with a worst-case error bound of 2 have been developed for it. We provide two improved heuristics for the problem, and show that each has a w orst-case error bound of 5/3. (C) 2001 Elsevier Science B.V. All rights res erved.