IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v57y2019i1p182-199.html
   My bibliography  Save this article

Towards robustness of response times: minimising the maximum inter-completion time on parallel machines

Author

Listed:
  • Feifeng Zheng
  • Michael L. Pinedo
  • Kangbok Lee
  • Ming Liu
  • Yinfeng Xu

Abstract

Motivated by scheduling practices that require a response to unplanned high-priority jobs as soon as possible without preempting any in-processing jobs, this paper considers a deterministic identical parallel machine scheduling problem to achieve robustness with regard to a worst-case response time. To the best of our knowledge, this paper is the first to study the objective of minimising the maximum inter-completion time, i.e. the maximum time difference between any two consecutive completion times of jobs. For this novel scheduling problem, we first show its NP-hardness, and then propose an integer linear programming formulation and three heuristic approaches. Numerical experiments demonstrate the efficiency of our solution methods.

Suggested Citation

  • Feifeng Zheng & Michael L. Pinedo & Kangbok Lee & Ming Liu & Yinfeng Xu, 2019. "Towards robustness of response times: minimising the maximum inter-completion time on parallel machines," International Journal of Production Research, Taylor & Francis Journals, vol. 57(1), pages 182-199, January.
    • Handle: RePEc:taf:tprsxx:v:57:y:2019:i:1:p:182-199
    DOI: 10.1080/00207543.2018.1466063
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2018.1466063
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2018.1466063?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.

    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:tprsxx:v:57:y:2019:i:1:p:182-199. 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/TPRS20 .

    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.