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

Solving a flexible job shop lot sizing problem with shared operations using a self-adaptive COA

Author

Listed:
  • Hadi Abdollahzadeh Sangroudi
  • Mehdi Ranjbar-Bourani

Abstract

This paper deals with lot sizing decisions in a flexible job shop manufacturing system considering dependencies between lot sizing decisions. A novel mathematical model is developed to optimise lot sizing and scheduling simultaneously using a product-oriented approach as opposed to the job-oriented approach which has been prevalently considered in the literature. Moreover, the proposed model considers further underlying assumptions such as assembly operations, sequence-dependent setup times, initial inventory and safety stock levels, as well as lots with unequal and variable sizes. The objective is to minimise the total production, setup, and tardiness penalty costs of the system. To solve the formulated problem, a self-adaptive Cuckoo Optimisation Algorithm (COA) embedded with three new immigration mechanisms is developed. Numerical experiments are conducted to demonstrate the validity of the model and investigate the efficiency and effectiveness of the employed optimisation algorithm.

Suggested Citation

  • Hadi Abdollahzadeh Sangroudi & Mehdi Ranjbar-Bourani, 2021. "Solving a flexible job shop lot sizing problem with shared operations using a self-adaptive COA," International Journal of Production Research, Taylor & Francis Journals, vol. 59(2), pages 483-515, January.
    • Handle: RePEc:taf:tprsxx:v:59:y:2021:i:2:p:483-515
    DOI: 10.1080/00207543.2019.1696492
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2019.1696492
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2019.1696492?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:59:y:2021:i:2:p:483-515. 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.