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

The cyclic separation scheduling problem

Author

Listed:
  • Ronald D. Armstrong
  • Prabhakant Sinha

Abstract

This paper deals with the problem of scheduling items (tasks, employees, equipment, etc.) over a finite time horizon so as to minimize total cost expenditures while maintaining a predefined separation between certain items. The problem is cyclic, because the same schedule will be repeated over several consecutive time periods of equal length. Thus, requirements are present to maintain the separation of items not only within the individual time periods considered, but also between items in adjoining periods. A special purpose branch‐and‐bound algorithm is developed to solve this scheduling problem by taking advantage of its cyclic nature. Computational results are given.

Suggested Citation

  • Ronald D. Armstrong & Prabhakant Sinha, 1977. "The cyclic separation scheduling problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 24(4), pages 609-618, December.
    • Handle: RePEc:wly:navlog:v:24:y:1977:i:4:p:609-618
    DOI: 10.1002/nav.3800240408
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800240408
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800240408?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
    ---><---

    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:24:y:1977:i:4:p:609-618. 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.