IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v27y1980i3p489-498.html
   My bibliography  Save this article

Scheduling coupled tasks

Author

Listed:
  • Roy D. Shapiro

Abstract

Consider a set of task pairs coupled in time: a first (initial) and second (completion) tasks of known durations with a specified time between them. If the operator or machine performing these tasks is able to process only one at a time, scheduling is necessary to insure that no overlap occurs. This problem has a particular application to production scheduling, transportation, and radar operations (send‐receive pulses are ideal examples of time‐linked tasks requiring scheduling). This article discusses several candidate techniques for schedule determination, and these are evaluated in a specific radar scheduling application.

Suggested Citation

  • Roy D. Shapiro, 1980. "Scheduling coupled tasks," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 27(3), pages 489-498, September.
    • Handle: RePEc:wly:navlog:v:27:y:1980:i:3:p:489-498
    DOI: 10.1002/nav.3800270312
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800270312
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800270312?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. Khatami, Mostafa & Salehipour, Amir & Cheng, T.C.E., 2020. "Coupled task scheduling with exact delays: Literature review and models," European Journal of Operational Research, Elsevier, vol. 282(1), pages 19-39.
    2. Nadjat Meziani & Ammar Oulamara & Mourad Boudhar, 2019. "Two-machine flowshop scheduling problem with coupled-operations," Annals of Operations Research, Springer, vol. 275(2), pages 511-530, April.
    3. David Fischer & Péter Györgyi, 2023. "Approximation algorithms for coupled task scheduling minimizing the sum of completion times," Annals of Operations Research, Springer, vol. 328(2), pages 1387-1408, September.
    4. Mostafa Khatami & Amir Salehipour, 2021. "Coupled task scheduling with time-dependent processing times," Journal of Scheduling, Springer, vol. 24(2), pages 223-236, April.
    5. Bo Chen & Xiandong Zhang, 2021. "Scheduling coupled tasks with exact delays for minimum total job completion time," Journal of Scheduling, Springer, vol. 24(2), pages 209-221, April.
    6. S. Bessy & R. Giroudeau, 2019. "Parameterized complexity of a coupled-task scheduling problem," Journal of Scheduling, Springer, vol. 22(3), pages 305-313, June.
    7. Mostafa Khatami & Amir Salehipour, 2021. "A binary search algorithm for the general coupled task scheduling problem," 4OR, Springer, vol. 19(4), pages 593-611, December.

    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:navlog:v:27:y:1980:i:3:p:489-498. 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)1931-9193 .

    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.