Lushchakova, Irina N., Soper, Alan J. ORCID: 0000-0002-0901-9803 and Strusevich, Vitaly A. (2008) Transporting jobs through a two-machine open shop. Naval Research Logistics (NRL), 56 (1). pp. 1-18. ISSN 0894-069X (Print), 1520-6750 (Online) (doi:https://doi.org/10.1002/nav.20323)

Full text not available from this repository.

Abstract

We consider the two-machine open shop scheduling problem in which the jobs are brought to the system by a single transporter and moved between the processing machines by the same transporter. The purpose is to split the jobs into batches and to find the sequence of moves of the transporter so that the time by which the completed jobs are collected together on board the transporter is minimal. We present a 7/5-approximation algorithm. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009

Item Type:	Article
Uncontrolled Keywords:	scheduling with transportation, open shop, approximation algorithm,
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Pre-2014 Departments:	School of Computing & Mathematical Sciences School of Computing & Mathematical Sciences > Computer & Computational Science Research Group School of Computing & Mathematical Sciences > Department of Computer Science School of Computing & Mathematical Sciences > Department of Mathematical Sciences School of Computing & Mathematical Sciences > Statistics & Operational Research Group
Related URLs:	Publisher Organisation
Last Modified:	14 Oct 2016 09:03
URI:	http://gala.gre.ac.uk/id/eprint/1304

Actions (login required)

View Item