Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
Open Shop Scheduling to Minimize Finish Time
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximation schemes for constrained scheduling problems
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Scheduling open shops with parallel machines
Operations Research Letters
New and improved algorithms for minsum shop scheduling
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
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
Minimizing makespan in a two-stage system with flowshop and open shop
Computers and Industrial Engineering
A genetic algorithm for the proportionate multiprocessor open shop
Computers and Operations Research
Minimizing makespan in a two-stage system with flowshop and open shop
Computers and Industrial Engineering
Solving a multi-objective open shop scheduling problem by a novel hybrid ant colony optimization
Expert Systems with Applications: An International Journal
A linear time approximation scheme for makespan minimization in an open shop with release dates
Operations Research Letters
Approximation algorithms for parallel open shop scheduling
Information Processing Letters
A new three-machine shop scheduling: complexity and approximation algorithm
Journal of Combinatorial Optimization
Hi-index | 0.00 |
We investigate the multiprocessor multi-stage open-shop scheduling problem. In this variant of the open-shop model, there are s stages, each consisting of a number of parallel identical machines. Each job consists of s operations, one for each stage, that can be executed in any order. The goal is to find a non-preemptive schedule that minimizes the makespan. We derive two approximation results for this NP-hard problem. First, we demonstrate the existence of a polynomial-time approximation algorithm with worst case ratio 2 for the case that the number s of stages is part of the input. This algorithm is based on Racsmany's concept of dense schedules. Secondly, for the multiprocessor two-stage open-shop problem we derive a family of polynomial-time approximation algorithms whose worst-case ratios can be made arbitrarily close to 32.