| Issue |
RAIRO-Oper. Res.
Volume 49, Number 2, April-May 2015
New challenges in scheduling theory
|
|
|---|---|---|
| Page(s) | 383 - 391 | |
| DOI | https://doi.org/10.1051/ro/2014051 | |
| Published online | 19 January 2015 | |
O(log m)-approximation for the routing open shop problem∗
1 Sobolev Institute of Mathematics, Russia.
alvenko@math.nsc.ru
2 Novosibirsk State University, Russia
Received:
15
February
2012
Accepted:
26
September
2014
We consider the routing open shop problem which is a generalization of the open shop and the metric travelling salesman problems. The jobs are located in some transportation network, and the machines travel on the network to execute the jobs in the open shop environment. The machines are initially located at the same node (depot) and must return to the depot after completing all jobs. The goal is to find a non-preemptive schedule with the minimum makespan. We present a new polynomial-time approximation algorithm with worst-case performance guarantee O(log m), where m is the number of machines.
Mathematics Subject Classification: 90B06 / 90B35 / 68W25
Key words: Open shop / routing / approximation algorithms
© EDP Sciences, ROADEF, SMAI 2015
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.