|
|||||
|
|
Transporting jobs through a two‐machine open shop |
|
| Authors: | Irina N. Lushchakova Alan J. Soper Vitaly A. Strusevich |
| Affiliation: | 1. Belarusian State University of Informatics and Radioelectronics, 6 P. Brovka str., Minsk 220027, Republic of Belarus;2. School of Computing and Mathematical Sciences, University of Greenwich, Old Royal Naval College, Park Row, Greenwich, London SE10 9LS, United Kingdom |
| 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  ‐approximation algorithm. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009 |
| Keywords: | scheduling with transportation open shop approximation algorithm |