Parallel machine scheduling with nested job assignment restrictions

Authors:
Gabriella Muratore;Ulrich M. Schwarz;Gerhard J. Woeginger
Affiliations:
Department of Technology Management, TU Eindhoven, P.O.Box 513, 5600 MB Eindhoven, The Netherlands;Institut für Informatik, Christian-Albrechts-Universität zu Kiel, 24098 Kiel, Germany;Department of Mathematics and Computer Science, TU Eindhoven, P.O.Box 513, 5600 MB Eindhoven, The Netherlands
Venue:
Operations Research Letters
Year:
2010

Citing 4
Cited 2

Using dual approximation algorithms for scheduling problems theoretical and practical results

Journal of the ACM (JACM)
Approximation algorithms for scheduling unrelated parallel machines

Mathematical Programming: Series A and B
Graph balancing: a special case of scheduling unrelated parallel machines

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling unit length jobs with parallel nested machine processing set restrictions

Computers and Operations Research

Fast approximation algorithms for job scheduling with processing set restrictions

Theoretical Computer Science
Matching with sizes (or scheduling with processing set restrictions)

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We derive a polynomial time approximation scheme for a special case of makespan minimization on unrelated machines.