O(log m)-approximation for the routing open shop problem

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.

[1]  Bruce M. Maggs,et al.  Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules , 1999, Comb..

[2]  Bruce M. Maggs,et al.  Packet routing and job-shop scheduling inO(congestion+dilation) steps , 1994, Comb..

[3]  Shuo-Yan Chou,et al.  The museum visitor routing problem , 2010, Appl. Math. Comput..

[4]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[5]  Andreas Wiese,et al.  Universal Packet Routing with Arbitrary Bandwidths and Transit Times , 2011, IPCO.

[6]  Alexander V. Kononov,et al.  Efficient approximation algorithms for the routing open shop problem , 2013, Comput. Oper. Res..

[7]  Han Hoogeveen,et al.  Short Shop Schedules , 1997, Oper. Res..

[8]  Gábor Tardos,et al.  A constructive proof of the general lovász local lemma , 2009, JACM.

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  Oded Berman,et al.  A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network , 2005, Eur. J. Oper. Res..

[11]  Oded Berman,et al.  The routing open-shop problem on a network: Complexity and approximation , 2006, Eur. J. Oper. Res..

[12]  Teofilo F. Gonzalez,et al.  Open Shop Scheduling to Minimize Finish Time , 1976, JACM.

[13]  Karthekeyan Chandrasekaran,et al.  Deterministic algorithms for the Lovász Local Lemma , 2009, SODA '10.

[14]  David B. Shmoys,et al.  Improved approximation algorithms for shop scheduling problems , 1991, SODA '91.

[15]  Oded Berman,et al.  A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems , 1999, Oper. Res..

[16]  A. V. Kononov.  On the routing open shop problem with two machines on a two-vertex network , 2012 .