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

Authors:
Moshe Kaspi;Dvir Shabtay
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
Venue:
Computers and Operations Research
Year:
2006

Citing 5
Cited 9

Convex resource allocation problems on directed acyclic graphs: duality, complexity, special cases, and extensions

Mathematics of Operations Research
Bicriterion Single Machine Scheduling with Resource Dependent Processing Times

SIAM Journal on Optimization
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
Multicriteria Scheduling: Theory, Models and Algorithms

Multicriteria Scheduling: Theory, Models and Algorithms

A survey of scheduling with controllable processing times

Discrete Applied Mathematics
Minimizing the number of late jobs for the permutation flowshop problem with secondary resources

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

Journal of Scheduling
Minimizing total tardiness on a single machine with controllable processing times

Computers and Operations Research
Single machine common due window scheduling with controllable job processing times

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Single-machine group scheduling with resource allocation and learning effect

Computers and Industrial Engineering
Parallel machine scheduling problem to minimize the makespan with resource dependent processing times

Applied Soft Computing
Scheduling with compressible and stochastic release dates

Computers and Operations Research
Single-machine due-window assignment and scheduling with resource allocation, aging effect, and a deteriorating rate-modifying activity

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents a bicriterion analysis of time/cost trade-offs for the single-machine scheduling problem where both job processing times and release dates are controllable by the allocation of a continuously nonrenewable resource. Using the bicriterion approach, we distinguish between our sequencing criterion, namely the makespan, and the cost criterion, the total resource consumed, in order to construct an efficient time/cost frontier. Although the computational complexity of the problem of constructing this frontier remains an open question, we show that the optimal job sequence is independent of the total resource being used; thereby we were able to reduce the problem to a sequencing one. We suggest an exact dynamic programming algorithm for solving small to medium sizes of the problem, while for large-scale problems we present some heuristic algorithms that turned out to be very efficient. Five different special cases that are solvable by using polynomial time algorithms are also presented.