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

Research on balancing and sequencing problems of flexible mixed model assembly lines with alternative precedence relations

Author

Listed:
  • Yunfang Peng
  • Lijun Zhang
  • Beixin Xia
  • Yajuan Han

Abstract

To tackle the balancing and sequencing problems of flexible mixed model assembly lines with alternative precedence relations, If–then rules and AND/OR graphs are adopted as modelling tools to replace precedence graphs that have limitations in representing alternative precedence relations. Mixed integer linear programming (MILP) and constraint programming (CP) models are established respectively. Moreover, an iterative decomposition method is developed to deal with large-sized problems. Computational experiments on different scales are carried out to test those methods. The computational results reveal that the performance of CP is better than MILP especially when more OR relations exist. And the iterative decomposition method outperforms MILP and CP in terms of solution quality and time.

Suggested Citation

  • Yunfang Peng & Lijun Zhang & Beixin Xia & Yajuan Han, 2023. "Research on balancing and sequencing problems of flexible mixed model assembly lines with alternative precedence relations," International Journal of Production Research, Taylor & Francis Journals, vol. 61(24), pages 8451-8467, December.
    • Handle: RePEc:taf:tprsxx:v:61:y:2023:i:24:p:8451-8467
    DOI: 10.1080/00207543.2022.2152890
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2022.2152890
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2022.2152890?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:61:y:2023:i:24:p:8451-8467. 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.