An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions

This paper addresses the problem of optimally inserting idle time into a single-machine schedule when the sequence is fixed and the cost of each job is a convex function of its completion time. We propose a pseudo-polynomial time algorithm to find a solution within some tolerance of optimality in the solution space, i.e., each completion time will belong to a small time interval z within which the optimal solution lies. Letting H be the planning horizon and |J| the number of jobs, the proposed algorithm is superior to the current best algorithm in terms of time-complexity when |J| < H/z.

[1]  Francis Sourd,et al.  PERT scheduling with convex cost functions , 2003, Theor. Comput. Sci..

[2]  William H. Press,et al.  Numerical Recipes in Fortran 77: The Art of Scientific Computing 2nd Editionn - Volume 1 of Fortran Numerical Recipes , 1992 .

[3]  William H. Press,et al.  Book-Review - Numerical Recipes in Pascal - the Art of Scientific Computing , 1989 .

[4]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[5]  John J. Kanet,et al.  Single-machine scheduling with early and tardy completion costs , 1993 .

[6]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[7]  Robert E. Tarjan,et al.  One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties , 1988, Math. Oper. Res..

[8]  David G. Luenberger,et al.  Linear and nonlinear programming , 1984 .

[9]  V. Sridharan,et al.  Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review , 2000, Oper. Res..

[10]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[11]  Thomas L. Morin,et al.  Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming , 1992, Comput. Oper. Res..

[12]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[13]  Bahram Alidaee.  Single machine scheduling with nonlinear cost functions , 1991, Comput. Oper. Res..

[14]  Francis Sourd.  Scheduling a sequence of tasks with general completion costs , 2002 .

[15]  Tamio Shimizu,et al.  Algoritmo de programação de máquinas individuais com penalidades distintas de adiantamento e atraso , 2000 .

[16]  J. Blackstone,et al.  Minimizing Weighted Absolute Deviation in Single Machine Scheduling , 1987 .