Single machine scheduling problems with resource dependent release times

Authors:
Byung-Cheon Choi;Suk-Hun Yoon;Sung-Jin Chung
Affiliations:
Department of Industrial Engineering, Seoul National University, Seoul, Republic of Korea;Department of Industrial and Information Systems Engineering, Soongsil University, Seoul, Republic of Korea;Department of Industrial Engineering, Seoul National University, Seoul, Republic of Korea
Venue:
Computers and Operations Research
Year:
2007

Citing 3
Cited 1

Time-optimal control in a single machine problem with resource constraints

Automatica (Journal of IFAC)
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Scheduling to minimize the total weighted completion time with a constraint on the release time resource consumption

Mathematical and Computer Modelling: An International Journal

On scheduling a single machine with resource dependent release times

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider two single machine scheduling problems with resource dependent release times that can be controlled by a non-increasing convex resource consumption function. In the first problem, the objective is to minimize the total resource consumption with a constraint on the sum of job completion times. We show that a recognition version of the problem is NP-complete. In the second problem, the objective is to minimize the weighted total resource consumption and sum of job completion times with an initial release time greater than the total processing times. We provide some optimality conditions and show that the problem is polynomially solvable.