IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v35y1988i2p177-184.html
   My bibliography  Save this article

Scheduling tasks with sequence‐dependent processing times

Author

Listed:
  • Lucio Bianco
  • Salvatore Ricciardelli
  • Giovanni Rinaldi
  • Antonio Sassano

Abstract

In this article we consider the problem of minimizing the maximum completion time of a sequence of n jobs on a single machine. Nonzero ready times and sequence‐dependent processing times are allowed. Upper bounds, lower bounds, and dominance criteria are proposed and exploited in a branch‐and‐bound algorithm. Computational results are given.

Suggested Citation

  • Lucio Bianco & Salvatore Ricciardelli & Giovanni Rinaldi & Antonio Sassano, 1988. "Scheduling tasks with sequence‐dependent processing times," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(2), pages 177-184, April.
    • Handle: RePEc:wly:navres:v:35:y:1988:i:2:p:177-184
    DOI: 10.1002/1520-6750(198804)35:23.0.CO;2-V
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(198804)35:23.0.CO;2-V
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(198804)35:23.0.CO;2-V?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
    ---><---

    Citations

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


    Cited by:

    1. 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.
    2. V. Anjana & R. Sridharan & P. N. Ram Kumar, 2020. "Metaheuristics for solving a multi-objective flow shop scheduling problem with sequence-dependent setup times," Journal of Scheduling, Springer, vol. 23(1), pages 49-69, February.
    3. A. J. Mason & E. J. Anderson, 1991. "Minimizing flow time on a single machine with job classes and setup times," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(3), pages 333-350, June.
    4. Morais, Rafael & Bulhões, Teobaldo & Subramanian, Anand, 2024. "Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates," European Journal of Operational Research, Elsevier, vol. 315(2), pages 442-453.
    5. 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:wly:navres:v:35:y:1988:i:2:p:177-184. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.