The routing open shop problem: new approximation algorithms

Authors:
Ilya Chernykh;Nikita Dryuck;Alexander Kononov;Sergey Sevastyanov
Affiliations:
Sobolev Institute of Mathematics, Novosibirsk, Russia;Novosibirsk State University, Novosibirsk, Russia;Sobolev Institute of Mathematics, Novosibirsk, Russia;Sobolev Institute of Mathematics, Novosibirsk, Russia
Venue:
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Year:
2009

Citing 5
Cited 1

The delivery man problem and cumulative matroids

Operations Research
Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)
A heuristic for two-machine open-shop scheduling problem with transportation times

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Simple Heuristic for M-Machine Flow-Shop and its Applications in Routing-Scheduling Problems

Operations Research

Improved approximation algorithms for routing shop scheduling

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the routing open shop problem being a generalization of the open shop and the metric travelling salesman problems. The jobs are located at nodes of 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 the jobs. It is required to find a non-preemptive schedule that minimizes the makespan. The problem is NP-hard even on a two-node network with two machines. We present new polynomial-time approximation algorithms with worst-case performance guarantees.