A scheduling problem with job values given as a power function of their completion times

This paper deals with a problem of scheduling jobs on the identical parallel machines, where job values are given as a power function of the job completion times. Minimization of the total loss of job values is considered as a criterion. We establish the computational complexity of the problem - strong NP-hardness of its general version and NP-hardness of its single machine case. Moreover, we solve some special cases of the problem in polynomial time. Finally, we construct and experimentally test branch and bound algorithm (along with some elimination properties improving its efficiency) and several heuristic algorithms for the general case of the problem.

[1]  Gur Mosheiov,et al.  Scheduling jobs with step-deterioration; minimizing makespan on a single- and multi-machine , 1995 .

[2]  Roberto Tadei,et al.  Minimizing the weighted sum of quadratic completion times on a single machine , 1995 .

[3]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[4]  T. C. Edwin Cheng,et al.  Parallel machine scheduling to minimize the sum of quadratic completion times , 2004 .

[5]  Geraldo Ferrer,et al.  The economics of personal computer remanufacturing , 1997 .

[6]  Chung-Lun Li,et al.  Scheduling to minimize the total weighted completion time with a constraint on the release time resource consumption , 1994 .

[7]  Adam Janiak,et al.  Minimizing maximum lateness under linear deterioration , 2000, Eur. J. Oper. Res..

[8]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[9]  Edward G. Coffman,et al.  Scheduling independent tasks to reduce mean finishing time , 1974, CACM.

[10]  W. Szwarc,et al.  The single machine problem with a quadratic cost function of completion times , 1988 .

[11]  T. C. Edwin Cheng,et al.  Single machine batch scheduling with deadlines and resource dependent processing times , 1995, Oper. Res. Lett..

[12]  Wieslaw Kubiak,et al.  A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs , 1998, J. Heuristics.

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  T. C. Edwin Cheng,et al.  Single machine scheduling with a variable common due date and resource-dependent processing times , 2003, Comput. Oper. Res..

[15]  Costas P. Pappis,et al.  Scheduling jobs with values exponentially deteriorating over time , 2002 .

[16]  Gur Mosheiov,et al.  Scheduling jobs under simple linear deterioration , 1994, Comput. Oper. Res..

[17]  Gur Mosheiov,et al.  Complexity analysis of job-shop scheduling with deteriorating jobs , 2002, Discret. Appl. Math..

[18]  Mikhail Y. Kovalyov,et al.  Uniform Machine Scheduling of Unit-time Jobs Subject to Resource Constraints , 1998, Discret. Appl. Math..

[19]  W. Townsend.  The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution , 1978 .

[20]  B. J. Lageweg,et al.  Scheduling identical jobs on uniform parallel machines , 1989 .

[21]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .