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

L. Bianco, P. Dell'Olmo and S. Giordani

Annals of Operations Research, 1999, vol. 86, issue 0, 393-415

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. Copyright Kluwer Academic Publishers 1999

Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (17)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018975323093 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:86:y:1999:i:0:p:393-415:10.1023/a:1018975323093

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018975323093

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().