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

A heuristic model for dynamic flexible job shop scheduling problem considering variable processing times

Author

Listed:
  • Melissa Shahgholi Zadeh
  • Yalda Katebi
  • Ali Doniavi

Abstract

In real scheduling problems, unexpected changes may occur frequently such as changes in task features. These changes cause deviation from primary scheduling. In this article, a heuristic model, inspired from Artificial Bee Colony algorithm, is proposed for a dynamic flexible job-shop scheduling (DFJSP) problem. This problem consists of n jobs that should be processed by m machines and the processing time of jobs deviates from estimated times. The objective is near-optimal scheduling after any change in tasks in order to minimise the maximal completion time (Makespan). In the proposed model, first, scheduling is done according to the estimated processing times and then re-scheduling is performed after determining the exact ones considering machine set-up. In order to evaluate the performance of the proposed model, some numerical experiments are designed in small, medium and large sizes in different levels of changes in processing times and statistical results illustrate the efficiency of the proposed algorithm.

Suggested Citation

  • Melissa Shahgholi Zadeh & Yalda Katebi & Ali Doniavi, 2019. "A heuristic model for dynamic flexible job shop scheduling problem considering variable processing times," International Journal of Production Research, Taylor & Francis Journals, vol. 57(10), pages 3020-3035, May.
    • Handle: RePEc:taf:tprsxx:v:57:y:2019:i:10:p:3020-3035
    DOI: 10.1080/00207543.2018.1524165
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2018.1524165
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2018.1524165?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Aidin Delgoshaei & Mohd Khairol Anuar Bin Mohd Ariffin & Zulkiflle B. Leman, 2022. "An Effective 4–Phased Framework for Scheduling Job-Shop Manufacturing Systems Using Weighted NSGA-II," Mathematics, MDPI, vol. 10(23), pages 1-28, December.
    2. Zhijie Huang & Lin Huang & Debiao Li, 2024. "Co-Evolutionary Algorithm for Two-Stage Hybrid Flow Shop Scheduling Problem with Suspension Shifts," Mathematics, MDPI, vol. 12(16), pages 1-30, August.
    3. Sun, Yige & Chung, Sai-Ho & Wen, Xin & Ma, Hoi-Lam, 2021. "Novel robotic job-shop scheduling models with deadlock and robot movement considerations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 149(C).
    4. Mei Li & Gai-Ge Wang & Helong Yu, 2021. "Sorting-Based Discrete Artificial Bee Colony Algorithm for Solving Fuzzy Hybrid Flow Shop Green Scheduling Problem," Mathematics, MDPI, vol. 9(18), pages 1-30, September.

    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:57:y:2019:i:10:p:3020-3035. 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.