Approximation algorithms for parallel open shop scheduling

Authors:
Yong Chen;An Zhang;Guangting Chen;Jianming Dong
Affiliations:
Institute of Operational Research and Cybernetics, Hangzhou Dianzi University, Hangzhou 310018, PR China;Institute of Operational Research and Cybernetics, Hangzhou Dianzi University, Hangzhou 310018, PR China;Institute of Operational Research and Cybernetics, Hangzhou Dianzi University, Hangzhou 310018, PR China;Department of Mathematics, Zhejiang University, Hangzhou 310027, PR China
Venue:
Information Processing Letters
Year:
2013

Citing 4
Cited 0

Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)
Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
Approximation algorithms for the multiprocessor open shop scheduling problem

Operations Research Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper investigates the parallel open shop scheduling problem. In this problem each job consists of two independent operations, which must be non-preemptively processed by one of m parallel identical two-machine open shops. The objective is to minimize the makespan. Because of NP-hardness, we provide polynomial time approximation algorithms for the problem. If there are m open shops, our algorithm has a worst case ratio of 2. If only two open shops are valid, it can be improved to 32.