Single machine scheduling with flow time and earliness penalties

This paper considers the problem of schedulingn jobs on a single machine to minimize the total cost incurred by their respective flow time and earliness penalties. It is assumed that each job has a due date that must be met, and that preemptions are not allowed. The problem is formulated as a dynamic program (DP) and solved with a reaching algorithm that exploits a series of dominance properties and efficiently generated bounds. A major factor underlying the effectiveness of the approach is the use of a greedy randomized adaptive search procedure (GRASP) to construct high quality feasible solutions. These solutions serve as upper bounds on the optimum, and permit a predominant portion of the state space to be fathomed during the DP recursion.To evaluate the performance of the algorithm, an experimental design involving over 240 randomly generated problems was followed. The test results indicate that problems with up to 30 jobs can be readily solved on a microcomputer in less than 12 minutes. This represents a significant improvement over previously reported results for both dynamic programming and mixed integer linear programming approaches.

[1]  Marc E. Posner,et al.  Minimizing Weighted Completion Times with Deadlines , 1985, Oper. Res..

[2]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[3]  Suresh Chand,et al.  Single machine scheduling to minimize weighted earliness subject to no tardy jobs , 1988 .

[4]  T. Sen,et al.  A branch-and-bound approach to the bicriterion scheduling problem invloving total flowtime and range of lateness , 1988 .

[5]  Thomas L. Morin,et al.  Branch-and-Bound Strategies for Dynamic Programming , 2015, Oper. Res..

[6]  Chris N. Potts,et al.  An algorithm for single machine sequencing with release dates to minimize total weighted completion time , 1983, Discret. Appl. Math..

[7]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[8]  J. J. Kanet.  Minimizing the average deviation of job completion times about a common due date , 1981 .

[9]  Jonathan F. Bard,et al.  Note-Operations Sequencing in Discrete Parts Manufacturing , 1989 .

[10]  Timothy D. Fry,et al.  A BI-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden , 1987, Comput. Oper. Res..

[11]  L FoxBennett,et al.  Shortest-Route Methods , 1979 .

[12]  Jonathan F. Bard,et al.  A GRASPTM for a difficult single machine scheduling problem, , 1991, Comput. Oper. Res..

[13]  J. Erschler,et al.  Applying new dominance concepts to job schedule optimization , 1982 .

[14]  Averill M. Law,et al.  The art and theory of dynamic programming , 1977 .

[15]  Jwm Will Bertrand,et al.  A comparison of due-date selection rules , 1981 .

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

[17]  J. Wesley Barnes,et al.  Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs , 1981, Oper. Res..

[18]  S. Bansal.  Single machine scheduling to minimize weighted sum of completion times with secondary criterion -- A branch and bound approach , 1980 .

[19]  Chris N. Potts,et al.  A Branch and Bound Algorithm for the Total Weighted Tardiness Problem , 1985, Oper. Res..

[20]  Earl E. Bomberger,et al.  A Dynamic Programming Approach to a Lot Size Scheduling Problem , 1966 .

[21]  E. Denardo,et al.  Shortest-Route Methods: 1. Reaching, Pruning, and Buckets , 1979, Oper. Res..

[22]  Bruce Faaland,et al.  Scheduling Tasks with Due Dates in a Fabrication/Assembly Process , 1987, Oper. Res..

[23]  Uday S. Karmarkar,et al.  Batching to minimize flow times on one machine , 1987 .

[24]  Jerzy Kyparisis,et al.  Single machine scheduling research , 1987 .

[25]  R. A. Blau.  N-Job, One Machine Sequencing Problems Under Uncertainty , 1973 .

[26]  Pierre N. Robillard,et al.  Scheduling with earliest start and due date constraints , 1971 .