A 32-approximation algorithm for parallel machine scheduling with controllable processing times

Authors:
Feng Zhang;Guochun Tang;Zhi-Long Chen
Affiliations:
Shanghai Second Polytechnic University, Shanghai, China;Shanghai Second Polytechnic University, Shanghai, China;Department of Systems Engineering, University of Pennsylvania, 220 South 33rd Street, Philadelphia, PA 19104-6315, USA
Venue:
Operations Research Letters
Year:
2001

Citing 7
Cited 2

A survey of results for sequencing problems with controllable processing times

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times

Discrete Applied Mathematics
Convex quadratic and semidefinite programming relaxations in scheduling

Journal of the ACM (JACM)
Non-approximability Results for Scheduling Problems with Minsum Criteria

Proceedings of the 6th International IPCO Conference on Integer Programming and Combinatorial Optimization
Semidefinite Relaxations for Parallel Machine Scheduling

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Single machine scheduling with discretely controllable processing times

Operations Research Letters
A 32-approximation algorithm for parallel machine scheduling with controllable processing times

Operations Research Letters

A survey of scheduling with controllable processing times

Discrete Applied Mathematics
A 32-approximation algorithm for parallel machine scheduling with controllable processing times

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We derive a 32-approximation algorithm for the NP-hard parallel machine total weighted completion time problem with controllable processing times by the technique of convex quadratic programming relaxation.