Skip navigation

Two-machine flowshop scheduling problems with no-wait jobs

Two-machine flowshop scheduling problems with no-wait jobs

Kubzin, Mikhail A. and Strusevich, Vitaly A. (2004) Two-machine flowshop scheduling problems with no-wait jobs. Naval Research Logistics, 51 (4). pp. 613-631. ISSN 0894-069X (Print), 1520-6750 (Online) (doi:10.1002/nav.10118)

Full text not available from this repository.

Abstract

We study a two-machine flow shop scheduling problem with no-wait in process, in which one of the machines is not available during a specified time interval. We consider three scenarios of handing the operation affected by the nonavailability interval. Its processing may (i) start from scratch after the interval, or (ii) be resumed from the point of interruption, or (iii) be partially restarted after the interval. The objective is to minimize the makespan. We present an approximation algorithm that for all these scenarios delivers a worst-case ratio of 3/2. For the second scenario, we offer a 4/3-approximation algorithm.

Item Type: Article
Additional Information: [1] Accepted: 3 October 2003. [2] First published online: 17 March 2004. [3] Published in print: June 2004.
Uncontrolled Keywords: flow shop scheduling, no-wait in process, nonavailability interval, worst-case analysis
Subjects: Q Science > QA Mathematics > QA76 Computer software
T Technology > TJ Mechanical engineering and machinery
Pre-2014 Departments: School of Computing & Mathematical Sciences
School of Computing & Mathematical Sciences > Department of Mathematical Sciences
School of Computing & Mathematical Sciences > Statistics & Operational Research Group
Related URLs:
Last Modified: 14 Oct 2016 09:01
Selected for GREAT 2016: None
Selected for GREAT 2017: None
Selected for GREAT 2018: None
URI: http://gala.gre.ac.uk/id/eprint/721

Actions (login required)

View Item View Item