Skip navigation

Two-Machine Shop Scheduling with an Uncapacitated Interstage Transporter

Two-Machine Shop Scheduling with an Uncapacitated Interstage Transporter

Lee, Chung-Yee and Strusevich, Vitaly A. (2005) Two-Machine Shop Scheduling with an Uncapacitated Interstage Transporter. IIE Transactions, 37 (8). pp. 725-736. ISSN 0740-817X (Print), 1545-8830 (Online) (doi:10.1080/07408170590918290)

Full text not available from this repository.

Abstract

In this paper we study the two-machine flow shop and open shop problems to minimize the makespan with a single interstage transporter that may carry any number of jobs between the machines at a time. For each of these problems we present a best possible approximation algorithm within a class of schedules with at most two shipments. As a by-product of this research, for the problem of minimizing the makespan on parallel identical machines we analyze the ratio of the makespan for a non-preemptive schedule over the makespan of a preemptive schedule.

Item Type: Article
Pre-2014 Departments: School of Computing & Mathematical Sciences
School of Computing & Mathematical Sciences > Centre for Numerical Modelling & Process Analysis
School of Computing & Mathematical Sciences > Centre for Numerical Modelling & Process Analysis > Computational Mechanics & Reliability Group
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:02
Selected for GREAT 2016: None
Selected for GREAT 2017: None
Selected for GREAT 2018: None
URI: http://gala.gre.ac.uk/id/eprint/865

Actions (login required)

View Item View Item