Transporting jobs through a two-machine open shop
Tools
Lushchakova, Irina N., Soper, Alan J. and Strusevich, Vitaly A. (2009) Transporting jobs through a two-machine open shop. Naval Research Logistics, 56 (1). pp. 1-18. ISSN 0894-069X
Full text not available from this repository.Official URL: http://dx.doi.org/10.1002/nav.20323
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. (C) 2008 Wiley Periodicals, Inc.
| Item Type: | Article |
|---|---|
| Additional Information: | [1] ISSN: 0894-069X (Print), 1520-6750 (Online) |
| Uncontrolled Keywords: | scheduling with transportation, open shop, approximation algorithm |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| School / Department / Research Groups: | 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: | |
| Last Modified: | 05 Feb 2013 11:59 |
| URI: | http://gala.gre.ac.uk/id/eprint/1304 |
Actions (login required)
| View Item |



Tools
Tools