IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v43y2011i6p383-398.html
   My bibliography  Save this article

Robust scheduling on a single machine using time buffers

Author

Listed:
  • Dirk Briskorn
  • Joseph Leung
  • Michael Pinedo

Abstract

This article studies the scheduling of buffer times in a single-machine environment. A buffer time is a machine idle time in between two consecutive jobs and is a common tool to protect a schedule against disruptions such as machine failures. This article introduces new classes of robust machine scheduling problems. For an arbitrary non-preemptive scheduling problem 1|β|γ, three corresponding robustness problems are obtained: (i) maximize overall (weighted) buffer time while ensuring a given schedule's performance (with regard to the objective function γ); (ii) optimize the schedule's performance (with regard to γ) while ensuring a given minimum overall (weighted) buffer time; and (iii) find the trade-off curve regarding both objectives. The relationships between the different classes of problems and the corresponding underlying problems are outlined. Furthermore, the robust counterparts of three very basic single-machine scheduling problems are analyzed.

Suggested Citation

  • Dirk Briskorn & Joseph Leung & Michael Pinedo, 2011. "Robust scheduling on a single machine using time buffers," IISE Transactions, Taylor & Francis Journals, vol. 43(6), pages 383-398.
    • Handle: RePEc:taf:uiiexx:v:43:y:2011:i:6:p:383-398
    DOI: 10.1080/0740817X.2010.505123
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2010.505123
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/0740817X.2010.505123?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. Alexander Wyrowski & Nils Boysen & Dirk Briskorn & Stefan Schwerdfeger, 2024. "Public transport crowdshipping: moving shipments among parcel lockers located at public transport stations," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 46(3), pages 873-907, September.
    2. Sun, Xuting & Chung, Sai-Ho & Choi, Tsan-Ming & Sheu, Jiuh-Biing & Ma, Hoi Lam, 2020. "Combating lead-time uncertainty in global supply chain's shipment-assignment: Is it wise to be risk-averse?," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 406-434.
    3. Giorgi Tadumadze & Nils Boysen & Simon Emde, 2020. "Robust spotter scheduling in trailer yards," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(4), pages 995-1021, December.
    4. Che, Ada & Feng, Jianguang & Chen, Haoxun & Chu, Chengbin, 2015. "Robust optimization for the cyclic hoist scheduling problem," European Journal of Operational Research, Elsevier, vol. 240(3), pages 627-636.

    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:taf:uiiexx:v:43:y:2011:i:6:p:383-398. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.