Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem

Authors:
Klaus Jansen;Maxim Sviridenko
Affiliations:
-;-
Venue:
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Year:
2000

Citing 7
Cited 3

Using dual approximation algorithms for scheduling problems theoretical and practical results

Journal of the ACM (JACM)
Makespan minimization in job shops: a polynomial time approximation scheme

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)
`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications

Journal of the ACM (JACM)
A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem

Theoretical Computer Science
Approximability of flow shop scheduling

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Approximation algorithms for the multiprocessor open shop scheduling problem

Operations Research Letters

Two-stage proportionate flexible flow shop to minimize the makespan

Journal of Combinatorial Optimization
Approximation algorithms for parallel open shop scheduling

Information Processing Letters
A new three-machine shop scheduling: complexity and approximation algorithm

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the multiprocessor multi-stage open shop and flow shop scheduling problem. In both problems, there are s stages each consisting of a number mi of parallel identical machines for 1 ≤ i ≤ s. Each job consists of s operations with one operation for each stage. The goal is to find a non-preemptive schedule that minimizes the makespan. We propose polynomial time approximation schemes for the multiprocessor open shop and flow shop scheduling problem when the number of stages s is constant and the numbers of machines mi are non-constant.