Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H. Belouadah, M.E. Posner and C.N. Potts, Scheduling with release dates on a single machine to minimize total weighted completion time, Discr. Appl. Math. 36(1992)213-231.
L. Bianco, P. Dell'Olmo and S. Giordani, Scheduling models and algorithms for TMA traffic management, in: Modelling and Simulation in Air Traffic Management, eds. L. Bianco, P. Dell'Olmo and A. R. Odoni, Springer, 1997, pp. 139-167.
L. Bianco, A. Mingozzi and S. Ricciardelli, The traveling salesman problem with cumulative costs, Networks 23(1993)81-91.
L. Bianco and S. Ricciardelli, Scheduling on a single machine to minimize total weighted completion time subject to release dates, Nav. Res. Logist. Quart. 29(1982)151-167.
P. Brucker, J.K. Lenstra and A.H.G. Rinnooy Kan, Complexity of machine scheduling problems, Ann. of Discr. Math. 1(1977)343-362.
N. Christofides, A. Mingozzi and P. Toth, State space relaxation for the computation of bounds to routing problems, Networks 11(1981)145-164.
R.G. Dear and Y.S. Sherif, An algorithm for computer assisted sequencing and scheduling of terminal area operations, Transp. Res. A 25(1991)129-139.
M.I. Dessouky and J.S. Deogun, Scheduling jobs with unequal ready times to minimize total mean flow time, SIAM J. Comput. 10(1981)192-202.
M. Fischetti, G. Laporte and S. Martello, The delivery man problem and cumulative matroids, Oper. Res. 41(1993)1055-1064.
M. Held, P. Wolfe and H.P. Crowder, Validation of subgradient optimization, Math. Progr. 6(1974)62-88.
R.L. Graham, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling theory: a survey, Ann. of Discr. Math. 5(1979)287-326.
J.K. Lenstra and A.H.G. Rinnooy Kan, Complexity results for scheduling chains on a single machine, Eur. J. Oper. Res. 4(1980)270-275.
H.N. Psaraftis, A dynamic programming approach to the aircraft sequencing problem, Report FTL R78-4, Flight Transportation Laboratory, M.I.T., Cambridge, USA, 1978.
H.N. Psaraftis, A dynamic programming approach for sequencing identical groups of jobs, Oper. Res. 28(1980)1347-1359.
A.H.G. Rinnooy Kan, Machine Scheduling Problems: Classification, Complexity and Computations, Martinus Nijhoff, The Hague, The Netherlands, 1976.
L. Schrage, A proof of the optimality of the shortest remaining processing time discipline, Oper. Res. 16(1968)687-690.
W.E. Smith, Various optimizer for single-stage production, Nav. Res. Logist. Quart. 3(1956)59-66.
C.S. Venkatakrishan, A. Barnett and A.R. Odoni, Landing at Logan airport: Describing and increasing airport capacity, Transp. Sci. 27(1993)211-227.
Rights and permissions
About this article
Cite this article
Bianco, L., Dell'Olmo, P. & Giordani, S. Minimizing total completion time subject to release dates and sequence‐dependentprocessing times. Annals of Operations Research 86, 393–415 (1999). https://doi.org/10.1023/A:1018975323093
Issue Date:
DOI: https://doi.org/10.1023/A:1018975323093