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

Authors:
Liron Yedidsion;Dvir Shabtay;Moshe Kaspi
Affiliations:
Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel;Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel;Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel
Venue:
Journal of Scheduling
Year:
2007

Citing 12
Cited 5

A survey of results for sequencing problems with controllable processing times

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Convex resource allocation problems on directed acyclic graphs: duality, complexity, special cases, and extensions

Mathematics of Operations Research
Some comments on sequencing with controllable processing times

Computing
Bicriterion Single Machine Scheduling with Resource Dependent Processing Times

SIAM Journal on Optimization
Single machine scheduling with a variable common due date and resource-dependent processing times

Computers and Operations Research
Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine

Computers and Operations Research
Minimizing the total weighted flow time in a single machine with controllable processing times

Computers and Operations Research
A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates

Computers and Operations Research
Single machine scheduling with controllable release and processing parameters

Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
A survey of scheduling with controllable processing times

Discrete Applied Mathematics
Single machine batch scheduling to minimize total completion time and resource consumption costs

Journal of Scheduling
Single machine batch scheduling with deadlines and resource dependent processing times

Operations Research Letters

Parallel machine match-up scheduling with manufacturing cost considerations

Journal of Scheduling
A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates

Computers and Operations Research
Single-machine scheduling with learning effect and resource-dependent processing times

Computers and Industrial Engineering
Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness

Computers and Operations Research
Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We extend the classical single-machine maximal lateness scheduling problem to the case where the job processing times are controllable by allocating a continuous and nonrenewable resource to the processing operations. Our aim is to construct an efficient trade-off curve between maximal lateness and total resource consumption using a bicriteria approach. We present a polynomial time algorithm that constructs this trade-off curve assuming a specified general type of convex decreasing resource consumption function. We illustrate the algorithm with a numerical example.