Pre-Emptive Scheduling Problems with Controllable Processing Times

Authors:
Natalia V. Shakhlevich;Vitaly A. Strusevich
Affiliations:
School of Computing, University of Leeds, Leeds, U.K. LS2 9JT;School of Computing and Mathematical Sciences, University of Greenwich, London, U.K. SE10 9LS
Venue:
Journal of Scheduling
Year:
2005

Citing 13
Cited 6

Integer and combinatorial optimization

Integer and combinatorial optimization
Generalized polymatroids and submodular flows

Mathematical Programming: Series A and B
A survey of results for sequencing problems with controllable processing times

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Algorithms for scheduling imprecise computations with timing constraints

SIAM Journal on Computing
Minimizing the weighted number of tardy task units

Discrete Applied Mathematics
A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times

Discrete Applied Mathematics
Some comments on sequencing with controllable processing times

Computing
Scheduling Algorithms

Scheduling Algorithms
Production and Operations Management

Production and Operations Management
Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard

Information Processing Letters
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Bicriterion Single Machine Scheduling with Resource Dependent Processing Times

SIAM Journal on Optimization
Multicriteria Scheduling: Theory, Models and Algorithms

Multicriteria Scheduling: Theory, Models and Algorithms

Scheduling imprecise computation tasks on uniform processors

Information Processing Letters
Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times --- A Polymatroid Optimization Approach

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Power-aware scheduling for makespan and flow

Journal of Scheduling
Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling

Discrete Applied Mathematics
A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates

Journal of Scheduling
Scheduling with due date assignment under special conditions on job processing

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a range of single machine and identical parallel machine pre-emptive scheduling models with controllable processing times. For each model we study a single criterion problem to minimize the compression cost of the processing times subject to the constraint that all due dates should be met. We demonstrate that each single criterion problem can be formulated in terms of minimizing a linear function over a polymatroid, and this justifies the greedy approach to its solution. A unified technique allows us to develop fast algorithms for solving both single criterion problems and bicriteria counterparts.