Improved approximation algorithms for routing shop scheduling

Authors:
Wei Yu;Guochuan Zhang
Affiliations:
College of Computer Science, Zhejiang University, Hangzhou, China;College of Computer Science, Zhejiang University, Hangzhou, China
Venue:
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Year:
2011

Citing 11
Cited 0

Improved Approximation Algorithms for Shop Scheduling Problems

SIAM Journal on Computing
A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A Simple Heuristic for M-Machine Flow-Shop and its Applications in Routing-Scheduling Problems

Operations Research
A 5/3-approximation algorithm for scheduling vehicles on a path with release and handling times

Information Processing Letters
2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times

Discrete Applied Mathematics
An approximability result of the multi-vehicle scheduling problem on a path with release and handling times

Theoretical Computer Science
Linear time approximation schemes for vehicle scheduling problems

Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times

ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Tight bounds for permutation flow shop scheduling

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Single-vehicle scheduling problems with release and service times on a line

Networks
The routing open shop problem: new approximation algorithms

WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate a generalization of classical shop scheduling where n jobs are located at the vertices of a general undirected graph and m machines must travel between the vertices to process the jobs. The aim is to minimize the makespan. For the open shop problem, we develop an O(logmloglogm)-approximation algorithm that significantly improves upon the best known $O(\sqrt{m})$-approximation algorithm. For the flow shop problem, we present an O(m2/3)-approximation algorithm that improves upon the best known $\max\{\frac{m+1}{2},\rho\}$-approximation algorithm, where ρ is the approximation factor for metric TSP.