IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v7y2013i2p206-223.html
   My bibliography  Save this article

Minimising maximum lateness in a single machine scheduling problem with processing time-based aging effects

Author

Listed:
  • RadosÅ‚aw Rudek

Abstract

In this paper, we analyse the single machine maximum lateness minimisation scheduling problem with the aging effect, where the job processing times are described by non-decreasing functions dependent on the sum of the normal processing times of already processed jobs. We prove that the considered problem is at least NP-hard even if job processing times are described by linear functions. Moreover, we construct the branch and bound method and implement well known approximation algorithms for the general version of the problem and verify numerically their efficiency. [Received 18 February 2011; Revised 26 May 2011, 3 September 2011; Accepted 12 September 2011]

Suggested Citation

  • RadosÅ‚aw Rudek, 2013. "Minimising maximum lateness in a single machine scheduling problem with processing time-based aging effects," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 7(2), pages 206-223.
    • Handle: RePEc:ids:eujine:v:7:y:2013:i:2:p:206-223
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=52575
    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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Peng Liu & Xiaoli Wang, 2017. "Maximum Lateness Scheduling on Two-Person Cooperative Games with Variable Processing Times and Common Due Date," Journal of Optimization, Hindawi, vol. 2017, pages 1-7, April.
    2. Ren-Xia Chen & Shi-Sheng Li, 2019. "Two-agent single-machine scheduling with cumulative deterioration," 4OR, Springer, vol. 17(2), pages 201-219, June.
    3. Allahverdi, Ali & Aydilek, Harun, 2014. "Total completion time with makespan constraint in no-wait flowshops with setup times," European Journal of Operational Research, Elsevier, vol. 238(3), pages 724-734.

    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:ids:eujine:v:7:y:2013:i:2:p:206-223. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=210 .

    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.