IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v66y2015i9p1481-1490.html
   My bibliography  Save this article

Minimizing total completion time on a single machine with step improving jobs

Author

Listed:
  • Eun-Seok Kim

    (Middlesex University, London, United Kingdom)

  • Daniel Oron

    (The University of Sydney Business School, Sydney, Australia)

Abstract

Production systems often experience a shock or a technological change, resulting in performance improvement. In such settings, job processing times become shorter if jobs start processing at, or after, a common critical date. This paper considers a single machine scheduling problem with step-improving processing times, where the effects are job-dependent. The objective is to minimize the total completion time. We show that the problem is NP-hard in general and discuss several special cases which can be solved in polynomial time. We formulate a Mixed Integer Programming model and develop an LP-based heuristic for the general problem. Finally, computational experiments show that the proposed heuristic yields very effective and efficient solutions.

Suggested Citation

  • Eun-Seok Kim & Daniel Oron, 2015. "Minimizing total completion time on a single machine with step improving jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(9), pages 1481-1490, September.
    • Handle: RePEc:pal:jorsoc:v:66:y:2015:i:9:p:1481-1490
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v66/n9/pdf/jors201491a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v66/n9/full/jors201491a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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:pal:jorsoc:v:66:y:2015:i:9:p:1481-1490. 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.palgrave-journals.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.