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

Hybrid branch and bound algorithms for the two-stage assembly scheduling problem with separated setup times

Author

Listed:
  • JianChao Luo
  • ZhiQiang Liu
  • KeYi Xing

Abstract

This article proposes hybrid branch and bound algorithms to minimise the makespan for the two-stage assembly scheduling problem with separated setup times. In the studied problem, there are multiple machines at the first stage, each of which produces a component of a job. When all components are available, a single assembly machine at the second stage completes the job. Existing algorithms are based on the state space search and hence suffer from the state space explosion problem. In order to reduce the search space, lower and upper bounds for a partial schedule are proposed. Also, a heuristic function and a dominance rule are developed to guide the search process. Moreover, accelerated factors are introduced to increase the speed of the search. Experimental results indicate that our algorithms outperform an existing method, and can find the optimal or near-optimal schedules in a short time for all tested problems with up to ten thousand jobs and nine first-stage machines.

Suggested Citation

  • JianChao Luo & ZhiQiang Liu & KeYi Xing, 2019. "Hybrid branch and bound algorithms for the two-stage assembly scheduling problem with separated setup times," International Journal of Production Research, Taylor & Francis Journals, vol. 57(5), pages 1398-1412, March.
    • Handle: RePEc:taf:tprsxx:v:57:y:2019:i:5:p:1398-1412
    DOI: 10.1080/00207543.2018.1489156
    as

    Download full text from publisher

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

    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:57:y:2019:i:5:p:1398-1412. 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.