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

A two-level optimisation-simulation method for production planning and scheduling: the industrial case of a human–robot collaborative assembly line

Author

Listed:
  • Miguel Vieira
  • Samuel Moniz
  • Bruno S. Gonçalves
  • Tânia Pinto-Varela
  • Ana Paula Barbosa-Póvoa
  • Pedro Neto

Abstract

In this work, a novel optimisation-simulation based on the Recursive Optimisation-Simulation Approach (ROSA) methodology is developed to provide effective decision-support for integrated production planning and scheduling. The proposed iterative approach optimises production plans while satisfying complex scheduling constraints, such as robots' allocation in collaborative tasks. The plans are determined through a two-level MILP model and are iteratively evaluated by a detailed discrete-event simulation model to guarantee capacity-feasible solutions at the scheduling level. Through an industrial case study of a multistage assembly line design collaboratively operated by humans and mobile shared robots, near-optimal solutions comprise lot-sizing decisions, the release schedule of production orders, the allocation of tasks to humans or robots, and the number of robots per period. Moreover, by addressing a set of propositions to assess the methodology, the results highlight the advantages of the hybrid approach to converge into optimised operational decisions and analyse the process dynamics.

Suggested Citation

  • Miguel Vieira & Samuel Moniz & Bruno S. Gonçalves & Tânia Pinto-Varela & Ana Paula Barbosa-Póvoa & Pedro Neto, 2022. "A two-level optimisation-simulation method for production planning and scheduling: the industrial case of a human–robot collaborative assembly line," International Journal of Production Research, Taylor & Francis Journals, vol. 60(9), pages 2942-2962, May.
    • Handle: RePEc:taf:tprsxx:v:60:y:2022:i:9:p:2942-2962
    DOI: 10.1080/00207543.2021.1906461
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2021.1906461
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2021.1906461?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:60:y:2022:i:9:p:2942-2962. 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.