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

Authors:
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
Venue:
Computers and Operations Research
Year:
2004

Citing 3
Cited 16

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

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

Computers and Operations Research
Scheduling with tool changes to minimize total completion time under controllable machining conditions

Computers and Operations Research
Scheduling parallel CNC machines with time/cost trade-off considerations

Computers and Operations Research
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
Bicriteria robotic cell scheduling

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
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
Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time

Computers and Operations Research
A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates

Journal of Scheduling
Parallel machine scheduling problem to minimize the makespan with resource dependent processing times

Applied Soft Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

The scheduling problem of a single machine with the minimum total weighted flow time criterion is extended to the case of allocating a continuously nonrenewable limited resource where the model of operations is assumed to be a specific convex function of the amount of resource consumed. The optimal resource allocation is obtained for any arbitrary job sequence. The computational complexity of the general problem remains an open question, but we present and analyze some special cases that are solvable by using polynomial time algorithms. An exact dynamic programming algorithm for small to medium size problems is suggested, while for large-scale problems we suggest some heuristic algorithms which appear to be very efficient.