Efficient approximation algorithms for the routing open shop problem

Authors:
Ilya Chernykh;Alexander Kononov;Sergey Sevastyanov
Affiliations:
Sobolev Institute of Mathematics, Acad. Koptyug pr. 4, 630090 Novosibirsk, Russia and Novosibirsk State University, Acad. Koptyug pr. 2, 630090 Novosibirsk, Russia;Sobolev Institute of Mathematics, Acad. Koptyug pr. 4, 630090 Novosibirsk, Russia and Novosibirsk State University, Acad. Koptyug pr. 2, 630090 Novosibirsk, Russia;Sobolev Institute of Mathematics, Acad. Koptyug pr. 4, 630090 Novosibirsk, Russia and Novosibirsk State University, Acad. Koptyug pr. 2, 630090 Novosibirsk, Russia
Venue:
Computers and Operations Research
Year:
2013

Citing 8
Cited 0

The delivery man problem and cumulative matroids

Operations Research
Data structures for weighted matching and nearest common ancestors with linking

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
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
Bandwidth constrained NP-Complete problems

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Integrating non-preemptive open shops scheduling with sequence-dependent setup times using advanced metaheuristics

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider the routing open shop problem being a generalization of two classical discrete optimization problems: the open shop scheduling problem and the metric traveling salesman problem. 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 with the minimum makespan. The problem is NP-hard even on the two-node network with two machines. We present new polynomial-time approximation algorithms with worst-case performance guarantees.