IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v86y1999i0p393-41510.1023-a1018975323093.html
   My bibliography  Save this article

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

Author

Listed:
  • L. Bianco
  • P. Dell'Olmo
  • S. Giordani

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

Suggested Citation

  • L. Bianco & P. Dell'Olmo & S. Giordani, 1999. "Minimizing total completion time subject to release dates and sequence‐dependentprocessing times," Annals of Operations Research, Springer, vol. 86(0), pages 393-415, January.
    • Handle: RePEc:spr:annopr:v:86:y:1999:i:0:p:393-415:10.1023/a:1018975323093
    DOI: 10.1023/A:1018975323093
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018975323093
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018975323093?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Julia Bennell & Mohammad Mesgarpour & Chris Potts, 2013. "Airport runway scheduling," Annals of Operations Research, Springer, vol. 204(1), pages 249-270, April.
    2. Jason A. D. Atkin & Edmund K. Burke & John S. Greenwood & Dale Reeson, 2009. "An examination of take-off scheduling constraints at London Heathrow airport," Public Transport, Springer, vol. 1(3), pages 169-187, August.
    3. Han Zhong & Wei Guan & Wenyi Zhang & Shixiong Jiang & Lingling Fan, 2018. "A bi-objective integer programming model for partly-restricted flight departure scheduling," PLOS ONE, Public Library of Science, vol. 13(5), pages 1-18, May.
    4. Pohl, Maximilian & Artigues, Christian & Kolisch, Rainer, 2022. "Solving the time-discrete winter runway scheduling problem: A column generation and constraint programming approach," European Journal of Operational Research, Elsevier, vol. 299(2), pages 674-689.
    5. Rakesh Prakash & Jitamitra Desai & Rajesh Piplani, 2022. "An optimal data-splitting algorithm for aircraft sequencing on a single runway," Annals of Operations Research, Springer, vol. 309(2), pages 587-610, February.
    6. Salehipour, Amir, 2020. "An algorithm for single- and multiple-runway aircraft landing problem," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 175(C), pages 179-191.
    7. Ahmed Ghoniem & Hanif D. Sherali & Hojong Baik, 2014. "Enhanced Models for a Mixed Arrival-Departure Aircraft Sequencing Problem," INFORMS Journal on Computing, INFORMS, vol. 26(3), pages 514-530, August.
    8. Samà, Marcella & D’Ariano, Andrea & D’Ariano, Paolo & Pacciarelli, Dario, 2017. "Scheduling models for optimal aircraft traffic control at busy airports: Tardiness, priorities, equity and violations considerations," Omega, Elsevier, vol. 67(C), pages 81-98.
    9. A R Brentnall & R C H Cheng, 2009. "Some effects of aircraft arrival sequence algorithms," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(7), pages 962-972, July.
    10. Jason A. D. Atkin & Geert De Maere & Edmund K. Burke & John S. Greenwood, 2013. "Addressing the Pushback Time Allocation Problem at Heathrow Airport," Transportation Science, INFORMS, vol. 47(4), pages 584-602, November.
    11. Jason A. D. Atkin & Edmund K. Burke & John S. Greenwood & Dale Reeson, 2007. "Hybrid Metaheuristics to Aid Runway Scheduling at London Heathrow Airport," Transportation Science, INFORMS, vol. 41(1), pages 90-106, February.
    12. Lieder, Alexander & Stolletz, Raik, 2016. "Scheduling aircraft take-offs and landings on interdependent and heterogeneous runways," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 88(C), pages 167-188.
    13. Pohl, Maximilian & Kolisch, Rainer & Schiffer, Maximilian, 2021. "Runway scheduling during winter operations," Omega, Elsevier, vol. 102(C).
    14. Bo Xu & Weimin Ma & Hui Huang & Lei Yue, 2016. "Weighted Constrained Position Shift Model for Aircraft Arrival Sequencing and Scheduling Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(04), pages 1-22, August.
    15. Daniel Karapetyan & Jason A. D. Atkin & Andrew J. Parkes & Juan Castro-Gutierrez, 2017. "Lessons from building an automated pre-departure sequencer for airports," Annals of Operations Research, Springer, vol. 252(2), pages 435-453, May.
    16. Geert De Maere & Jason A. D. Atkin & Edmund K. Burke, 2018. "Pruning Rules for Optimal Runway Sequencing," Transportation Science, INFORMS, vol. 52(4), pages 898-916, August.
    17. J. E. Beasley & M. Krishnamoorthy & Y. M. Sharaiha & D. Abramson, 2000. "Scheduling Aircraft Landings—The Static Case," Transportation Science, INFORMS, vol. 34(2), pages 180-197, May.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:86:y:1999:i:0:p:393-415:10.1023/a:1018975323093. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.