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

Solving the single machine scheduling problem with general job-dependent past-sequence-dependent setup times and learning effects

Author

Listed:
  • H.M. Soroush

Abstract

This paper deals with a single machine scheduling problem with general past-sequence-dependent (psd) setup time and log-linear learning in which the setup times and learning effects are job-dependent. The setup times are unique functions of the length of already processed jobs, and the learning effects show that processing times are unique decreasing functions of job positions. The goal is to find the optimal sequences that minimise objective functions such as the makespan, total completion time, total lateness, total waiting cost, total waiting time, total absolute differences in completion times, and the sum of earliness, tardiness and common due date penalty. Special cases of the resulting problems are solvable in polynomial time; however, the general problems are difficult to solve. We propose branch-and-bound (B%B) methods to derive the optimal sequences for such problems. Computational results show that the proposed methods can solve relatively large problem instances in reasonable amounts of time. [Received 21 December 2010; Revised 25 February 2011; Accepted 8 April 2011]

Suggested Citation

  • H.M. Soroush, 2012. "Solving the single machine scheduling problem with general job-dependent past-sequence-dependent setup times and learning effects," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 6(5), pages 596-628.
    • Handle: RePEc:ids:eujine:v:6:y:2012:i:5:p:596-628
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=48857
    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. Allahverdi, Ali, 2015. "The third comprehensive survey on scheduling problems with setup times/costs," European Journal of Operational Research, Elsevier, vol. 246(2), pages 345-378.
    2. Dirk Briskorn & Konrad Stephan & Nils Boysen, 2022. "Minimizing the makespan on a single machine subject to modular setups," Journal of Scheduling, Springer, vol. 25(1), pages 125-137, February.

    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:6:y:2012:i:5:p:596-628. 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.