IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v57y2003i1p111-123.html
   My bibliography  Save this article

Scheduling chains on a single machine with non-negative time lags

Author

Listed:
  • Alix Munier
  • Francis Sourd

Abstract

Chains of operations have to be scheduled on a single machine such that a minimum delay is set between any two operations linked by a precedence relation. Three sub-problems are shown to be solved in polynomial time. First, we consider the problem of minimizing the makespan when all the operations have the same duration p and all the delays are equal to a constant l. Next, we consider that the length of any delay is less than the shortest processing time and we present an algorithm to minimize the makespan and another one to minimize the flow time when all the processing times are equal. Copyright Springer-Verlag Berlin Heidelberg 2003

Suggested Citation

  • Alix Munier & Francis Sourd, 2003. "Scheduling chains on a single machine with non-negative time lags," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 57(1), pages 111-123, April.
    • Handle: RePEc:spr:mathme:v:57:y:2003:i:1:p:111-123
    DOI: 10.1007/s001860200242
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860200242
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s001860200242?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. C N Potts & J D Whitehead, 2007. "Heuristics for a coupled-operation scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(10), pages 1375-1388, October.
    2. J-B Wang & J-J Wang & P Ji, 2011. "Scheduling jobs with chain precedence constraints and deteriorating jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(9), pages 1765-1770, September.
    3. Courtad, Brenda & Baker, Kenneth & Magazine, Michael & Polak, George, 2017. "Minimizing flowtime for paired tasks," European Journal of Operational Research, Elsevier, vol. 259(3), pages 818-828.
    4. Novak, Antonin & Sucha, Premysl & Hanzalek, Zdenek, 2019. "Scheduling with uncertain processing times in mixed-criticality systems," European Journal of Operational Research, Elsevier, vol. 279(3), pages 687-703.
    5. Peter Brucker & Sigrid Knust & Ceyda Oğuz, 2006. "Scheduling chains with identical jobs and constant delays on a single machine," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 63(1), pages 63-75, February.
    6. N. Brauner & Y. Crama & A. Grigoriev & J. Klundert, 2005. "A Framework for the Complexity of High-Multiplicity Scheduling Problems," Journal of Combinatorial Optimization, Springer, vol. 9(3), pages 313-323, May.

    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:mathme:v:57:y:2003:i:1:p:111-123. 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.