Transporting jobs through a two‐machine open shop

Irina N. Lushchakova, Alan J. Soper and Vitaly A. Strusevich

Naval Research Logistics (NRL), 2009, vol. 56, issue 1, 1-18

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

Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
https://doi.org/10.1002/nav.20323

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:56:y:2009:i:1:p:1-18

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().