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

Balancing-sequencing paced assembly lines: a multi-objective mixed-integer linear case study

Author

Listed:
  • Thiago Cantos Lopes
  • Adalberto Sato Michels
  • Nadia Brauner
  • Leandro Magatão

Abstract

This paper considers the optimisation of Mixed-model assembly lines with continuous paced line control. The two minimisation goals have a mixed-integer linear multi-objective dispute. The paper proposes a criterion-space method to define the Pareto front for this class of problems. The method combines Pareto fronts obtained from integer solutions and gradually refines them until the instance's global front is determined. Comparing paced to unpaced line controls can be challenging, since they can produce the same cycle time given sufficiently long line lengths or buffers. Hence, determining Pareto fronts between cycle time and line length for paced lines allows meaningful comparisons between line controls. An industrial case study shows that line length acts as continuously distributable buffers for paced lines, leading to weaker diminishing returns. This result suggests that paced lines are more efficient than unpaced ones for lower cycle time ranges.

Suggested Citation

  • Thiago Cantos Lopes & Adalberto Sato Michels & Nadia Brauner & Leandro Magatão, 2023. "Balancing-sequencing paced assembly lines: a multi-objective mixed-integer linear case study," International Journal of Production Research, Taylor & Francis Journals, vol. 61(17), pages 5901-5917, September.
  • Handle: RePEc:taf:tprsxx:v:61:y:2023:i:17:p:5901-5917
    DOI: 10.1080/00207543.2022.2118888
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2022.2118888
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2022.2118888?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:17:p:5901-5917. 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.