Minimizing total completion time subject to release dates and sequence‐dependentprocessing times

We consider the problem of scheduling jobs with release dates and sequence‐dependentprocessing times on a single machine to minimize the total completion time. We show thatthis problem is equivalent to the Cumulative Traveling Salesman Problem with additionaltime constraints. For this latter problem, we give a dynamic programming formulation fromwhich lower bounds are derived. Two heuristic algorithms are proposed. Performanceanalysis of both lower bounds and heuristics on randomly generated test problems are carriedout. Moreover, the application of the model and algorithms to the real problem of sequencinglanding aircraft in the terminal area of a congested airport is analyzed. Computational resultson realistic data sets show that heuristic solutions can be effective in practical contexts.

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

[2]  C. N. Potts,et al.  Scheduling with release dates on a single machine to minimize total weighted completion time , 1992, Discret. Appl. Math..

[3]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[4]  Lucio Bianco,et al.  Scheduling of a single machine to minimize total weighted completion time subject to release dates , 1982 .

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

[6]  A. Kan.  Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

[7]  Lucio Bianco,et al.  The traveling salesman problem with cumulative costs , 1993, Networks.

[8]  Amedeo R. Odoni,et al.  Landings at Logan Airport: Describing and Increasing Airport Capacity , 1993, Transp. Sci..

[9]  Harilaos N. Psaraftis,et al.  A Dynamic Programming approach to the Aircraft Sequencing problem , 1978 .

[10]  Yosef S. Sherif,et al.  AN ALGORITHM FOR COMPUTER ASSISTED SEQUENCING AND SCHEDULING OF TERMINAL AREA OPERATIONS , 1991 .

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

[12]  Matteo Fischetti,et al.  The Delivery Man Problem and Cumulative Matroids , 1993, Oper. Res..

[13]  Jan Karel Lenstra,et al.  Complexity results for scheduling chains on a single machine : (preprint) , 1980 .

[14]  Paolo Toth,et al.  State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.

[15]  Lucio Bianco,et al.  Scheduling Models and Algorithms for TMA Traffic Management , 1997 .

[16]  Linus Schrage,et al.  Letter to the Editor - A Proof of the Optimality of the Shortest Remaining Processing Time Discipline , 1968, Oper. Res..

[17]  Jitender S. Deogun,et al.  Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time , 1981, SIAM J. Comput..

[18]  Harilaos N. Psaraftis,et al.  A Dynamic Programming Approach for Sequencing Groups of Identical Jobs , 1980, Oper. Res..