Approximation schemes for parallel machine scheduling problems with controllable processing times

Authors:
Klaus Jansen;Monaldo Mastrolilli
Affiliations:
Institut für Informatik und Praktische Mathematik, Universität zu Kiel, Olshausenstr. 40, Kiel D-24098, Germany;IDSIA, Galleria 2, 6928 Manno, Switzerland
Venue:
Computers and Operations Research
Year:
2004

Citing 9
Cited 7

Using dual approximation algorithms for scheduling problems theoretical and practical results

Journal of the ACM (JACM)
A survey of results for sequencing problems with controllable processing times

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
An approximation algorithm for the generalized assignment problem

Mathematical Programming: Series A and B
A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times

Discrete Applied Mathematics
Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A PTAS for the Single Machine Scheduling Problem with Controllable Processing Times

SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Job Shop Scheduling Problems with Controllable Processing Times

ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Single machine scheduling with discretely controllable processing times

Operations Research Letters

Scheduling with tool changes to minimize total completion time under controllable machining conditions

Computers and Operations Research
Scheduling parallel CNC machines with time/cost trade-off considerations

Computers and Operations Research
A survey of scheduling with controllable processing times

Discrete Applied Mathematics
Synthesis of reconfigurable high-performance multicore systems

Proceedings of the ACM/SIGDA international symposium on Field programmable gate arrays
Parallel machine scheduling problem to minimize the makespan with resource dependent processing times

Applied Soft Computing
LP rounding and an almost harmonic algorithm for scheduling with resource dependent processing times

APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Scheduling jobs with time-resource tradeoff via nonlinear programming

Discrete Optimization

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have a controllable processing time means that it is allowed to compress (a part of) the processing time of the job, in return for compression cost. We present the first known polynomial time approximation schemes for the nonpreemptive case of several identical parallel machines scheduling problems with controllable processing times. Moreover, we study the problem when preemption is allowed and describe efficient exact and approximation algorithms.