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

A two-stage three-machine assembly scheduling problem with a position-based learning effect

Author

Listed:
  • Chin-Chia Wu
  • Du-Juan Wang
  • Shuenn-Ren Cheng
  • I-Hong Chung
  • Win-Chin Lin

Abstract

The two-stage assembly scheduling problem has attracted increasing research attention. In many such problems, job processing times are commonly assumed to be fixed. However, this assumption does not hold in many real production situations. In fact, processing times usually decrease steadily when the same task is performed repeatedly. Therefore, in this study, we investigated a two-stage assembly position-based learning scheduling problem with two machines in the first stage and an assembly machine in the second stage. The objective was to complete all jobs as soon as possible (or to minimise the makespan, implying that the system can perform better and efficient task planning with limited resources). Because this problem is NP-hard, we derived some dominance relations and a lower bound for the branch-and-bound method for finding the optimal solution. We also propose three heuristics, three versions of the simulated annealing (SA) algorithm, and three versions of cloud theory-based simulated annealing algorithm for determining near-optimal solutions. Finally, we report the performance levels of the proposed algorithms.

Suggested Citation

  • Chin-Chia Wu & Du-Juan Wang & Shuenn-Ren Cheng & I-Hong Chung & Win-Chin Lin, 2018. "A two-stage three-machine assembly scheduling problem with a position-based learning effect," International Journal of Production Research, Taylor & Francis Journals, vol. 56(9), pages 3064-3079, May.
    • Handle: RePEc:taf:tprsxx:v:56:y:2018:i:9:p:3064-3079
    DOI: 10.1080/00207543.2017.1401243
    as

    Download full text from publisher

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

    Citations

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


    Cited by:

    1. Jin Qian & Yu Zhan, 2021. "The Due Date Assignment Scheduling Problem with Delivery Times and Truncated Sum-of-Processing-Times-Based Learning Effect," Mathematics, MDPI, vol. 9(23), pages 1-14, November.
    2. Xingong Zhang & Win-Chin Lin & Chin-Chia Wu, 2022. "Rescheduling problems with allowing for the unexpected new jobs arrival," Journal of Combinatorial Optimization, Springer, vol. 43(3), pages 630-645, April.
    3. Shaojun Lu & Jun Pei & Xinbao Liu & Xiaofei Qian & Nenad Mladenovic & Panos M. Pardalos, 2020. "Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing," Journal of Scheduling, Springer, vol. 23(6), pages 649-664, December.

    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:56:y:2018:i:9:p:3064-3079. 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.