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

Single-machine group scheduling with a general learning effect

Author

Listed:
  • Yunqiang Yin
  • Chin-Chia Wu
  • Wen-Hung Wu
  • Juei-Chao Chen

Abstract

This paper investigates some single-machine scheduling problems with a general learning effect and the group technology assumption. A setup time is incurred whenever the single machine transfers job processing from a family to another family. By the general learning effect, we mean that the actual group setup time depends not only on the total setup time of the groups already processed but also on its scheduled position, and the actual processing time of a job in a certain group depends not only on the total normal processing time of the jobs already processed in the group but also on its scheduled position. We show that the makespan minimisation problem remains polynomially solvable under the proposed models. We also show that the problems of minimising the total completion time, the total weighted completion time and the discounted total weighted completion time of all jobs have polynomial optimal solutions under certain conditions. [Received 16 March 2011; Revised 4 August 2011, 12 October 2011; Accepted 16 October 2011]

Suggested Citation

  • Yunqiang Yin & Chin-Chia Wu & Wen-Hung Wu & Juei-Chao Chen, 2013. "Single-machine group scheduling with a general learning effect," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 7(3), pages 350-369.
    • Handle: RePEc:ids:eujine:v:7:y:2013:i:3:p:350-369
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=54135
    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. 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:3:p:350-369. 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.