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

Authors:
Dvir Shabtay
Affiliations:
Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel
Venue:
Computers and Operations Research
Year:
2004

Citing 2
Cited 13

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

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

Computers and Operations Research
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
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
Tabu-search for single machine scheduling with controllable processing times

Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates

Computers and Operations Research
Optimal due date assignment and resource allocation in a group technology scheduling environment

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

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
Scheduling a batching machine with convex resource consumption functions

Information Processing Letters
Single-machine batch delivery scheduling with an assignable common due date and controllable processing times

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we extend the classical single-machine scheduling problem with the maximal lateness criterion to the case where the job processing times are controllable by allocating common limited resources. For the single resource problem we determine the optimal job sequence and resource allocation in O(n3) time, while for the two-resource problem the optimal solution is obtained in O(n3log(1/ε)) time, where ε is a given accuracy. For both cases, we assume a convex resource consumption function.