Single machine scheduling problems with resource dependent release times

Single machine scheduling problems with resource dependent release times

0.00 Avg rating0 Votes
Article ID: iaor20082411
Country: United Kingdom
Volume: 34
Issue: 7
Start Page Number: 1988
End Page Number: 2000
Publication Date: Jul 2007
Journal: Computers and Operations Research
Authors: , ,
Keywords: combinatorial analysis
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.

Reviews

Required fields are marked *. Your email address will not be published.