Some comments on sequencing with controllable processing times

Authors:
H. Hoogeveen;G. J. Woeginger
Affiliations:
Utrecht Univ., Utrecht the Netherlands;Univ. of Mathematics, Enschede, The Netherlands
Venue:
Computing
Year:
2002

Citing 0
Cited 11

Minimizing the total weighted flow time in a single machine with controllable processing times

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

Computing
Pre-Emptive Scheduling Problems with Controllable Processing Times

Journal of Scheduling
A survey of scheduling with controllable processing times

Discrete Applied Mathematics
A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine

Journal of Scheduling
Single-machine scheduling with learning effect and resource-dependent processing times

Computers and Industrial Engineering
Single-machine group scheduling with resource allocation and learning effect

Computers and Industrial Engineering
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
On several scheduling problems with rejection or discretely compressible processing times

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Complexity of a scheduling problem with controllable processing times

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss sequencing problems on a single machine with controllable job processing times. For the maximum job cost criterion, we present several polynomial time results. For the total weighted job completion time criterion, we present an NP-hardness result. Our results settle several open questions in this area.