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

Consideration of processing time dissimilarity in batch-cyclic scheduling of flowshop cells

Author

Listed:
  • Najat Almasarwah
  • Gürsel A. Süer

Abstract

Flowshop scheduling methods that appear in the literature assume that products are processed in either batch mode or cyclic mode. In batch mode, a product starts after another product is completely processed. On the other hand, in cyclic mode, products are run in mixed mode with unit transfer. In this paper, a new scheduling method, the batch-cyclic scheduling method, is proposed to schedule the products. In the proposed method, multiple sets of products (Cyclic Sets) are selected first and then products in each cyclic set are run in mixed mode. Overall, the general solution approach consists of three phases: (1) family formation based on processing similarity; (2) subfamily formulation based on a processing time dissimilarity (proposed mathematical model); (3) product scheduling using the batch-cyclic method (proposed mathematical model). As in the cyclic method, batch-cyclic scheduling is feasible when setup times are negligible. Due to the lack of work in this newly proposed batch-cyclic method, it is compared with the batch method. Additionally, the performance of the three-phase approach is compared with the two-phase approach using 27 scenarios. The results show that the proposed three-phase approach minimises the number of machines and lowers makespan when the bottleneck machine shifts.

Suggested Citation

  • Najat Almasarwah & Gürsel A. Süer, 2021. "Consideration of processing time dissimilarity in batch-cyclic scheduling of flowshop cells," International Journal of Production Research, Taylor & Francis Journals, vol. 59(21), pages 6544-6563, November.
  • Handle: RePEc:taf:tprsxx:v:59:y:2021:i:21:p:6544-6563
    DOI: 10.1080/00207543.2020.1818863
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207543.2020.1818863?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:21:p:6544-6563. 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.