A PTAS for the Single Machine Scheduling Problem with Controllable Processing Times

Authors:
Monaldo Mastrolilli
Affiliations:
-
Venue:
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Year:
2002

Citing 5
Cited 2

Jackson's rule for single-machine scheduling: making a good heuristic better

Mathematics of Operations Research
Near-Optimal Sequencing with Precedence Constraints

Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference
Grouping Techniques for One Machine Scheduling Subject to Precedence Constraints

FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Fast approximation algorithms for knapsack problems

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Approximation schemes for constrained scheduling problems

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science

Approximation schemes for parallel machine scheduling problems with controllable processing times

Computers and Operations Research
Notes on max flow time minimization with controllable processing times

Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

In a scheduling problemwith controllable processing times the job processing time can be compressed through incurring an additional cost. We consider the problemof scheduling n jobs on a single machine with controllable processing times. Each job has a release date, when it becomes available for processing, and, after completing its processing, requires an additional delivery time. Feasible schedules are further restricted by job precedence constraints. We develop a polynomial time approximation scheme whose running time depends only linearly on the input size. This improves and generalize the previous (3/2 + 驴)- approximation algorithm by Zdrzalka.