Premium
Transporting jobs through a two‐machine open shop
Author(s) -
Lushchakova Iri.,
Soper Alan J.,
Strusevich Vitaly A.
Publication year - 2009
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/nav.20323
Subject(s) - scheduling (production processes) , open shop , computer science , sequence (biology) , operations research , job shop scheduling , transporter , operations management , flow shop scheduling , mathematics , engineering , computer network , gene , chemistry , routing (electronic design automation) , biochemistry
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 \over 5} $ ‐approximation algorithm. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009