IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v57y2020i2d10.1007_s12597-019-00434-8.html
   My bibliography  Save this article

Performance evaluation of due-date based dispatching rules in dynamic scheduling of diffusion furnace

Author

Listed:
  • M. Vimala Rani

    (Indian Institute of Technology-Kharagpur)

  • M. Mathirajan

    (Indian Institute of Science, Bangalore)

Abstract

There has been extensive scheduling research relating to use of existing dispatching rules along with/without new dispatching rules and compared their performance behavior in job-shop, flow-shop, open-shop, flexible manufacturing system, and single machine with unit capacity environments using various scheduling objectives. However, it appears that there is no comparative study on analysis of dispatching rules for scheduling bottleneck batch processing machine in discrete parts manufacturing, particularly the diffusion furnace (DF) in semiconductor manufacturing (SM). This study addresses this research issue. For that, this study first, proposes the mathematical models for dynamic scheduling (DS) of DF to optimize the due-date based scheduling objectives: Total weighted tardiness, on-time delivery rate, total earliness/lateness, and maximum lateness. Due to the computational intractability of each the proposed mathematical models for large-scale problem, this study proposes greedy heuristic algorithm (GHA) based on due-date based dispatching rules (DDR). Because, dispatching rules are widely used in the SM industry. Accordingly, in this study twenty variants of GHA-DDR are proposed by considering various due-date based dispatching rules to compare the effects of due-date based dispatching rules in DS of DF. From the series of computational analysis carried out in this study, it is observed empirically that the proposed variants of GHA based on apparent tardiness cost (ATC) and batch ATC (BATC) dispatching rules yield consistently better solution for most of the scheduling objectives considered in this study. This observation is further verified by statistical analysis: Friedman test and Nemenyi multiple comparison test.

Suggested Citation

  • M. Vimala Rani & M. Mathirajan, 2020. "Performance evaluation of due-date based dispatching rules in dynamic scheduling of diffusion furnace," OPSEARCH, Springer;Operational Research Society of India, vol. 57(2), pages 462-512, June.
    • Handle: RePEc:spr:opsear:v:57:y:2020:i:2:d:10.1007_s12597-019-00434-8
    DOI: 10.1007/s12597-019-00434-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-019-00434-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12597-019-00434-8?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.

    References listed on IDEAS

    as
    1. Koh, Shie-Gheun & Koo, Pyung-Hoi & Kim, Dong-Chun & Hur, Won-Suk, 2005. "Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families," International Journal of Production Economics, Elsevier, vol. 98(1), pages 81-96, October.
    2. Malapert, Arnaud & Guéret, Christelle & Rousseau, Louis-Martin, 2012. "A constraint programming approach for a batch processing problem with non-identical job sizes," European Journal of Operational Research, Elsevier, vol. 221(3), pages 533-545.
    3. Ari P. J. Vepsalainen & Thomas E. Morton, 1987. "Priority Rules for Job Shops with Weighted Tardiness Costs," Management Science, INFORMS, vol. 33(8), pages 1035-1047, August.
    4. S. S. Panwalkar & Wafik Iskander, 1977. "A Survey of Scheduling Rules," Operations Research, INFORMS, vol. 25(1), pages 45-61, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    2. Seifert, Ralf W. & Morito, Susumu, 2001. "Cooperative dispatching - exploiting the flexibility of an FMS by means of incremental optimization," European Journal of Operational Research, Elsevier, vol. 129(1), pages 116-133, February.
    3. Kasper, T.A. Arno & Land, Martin J. & Teunter, Ruud H., 2023. "Towards System State Dispatching in High‐Variety Manufacturing," Omega, Elsevier, vol. 114(C).
    4. Bierwirth, C. & Kuhpfahl, J., 2017. "Extended GRASP for the job shop scheduling problem with total weighted tardiness objective," European Journal of Operational Research, Elsevier, vol. 261(3), pages 835-848.
    5. G-C Lee & Y-D Kim & J-G Kim & S-H Choi, 2003. "A dispatching rule-based approach to production scheduling in a printed circuit board manufacturing system," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(10), pages 1038-1049, October.
    6. Maria Raquel C. Costa & Jorge M. S. Valente & Jeffrey E. Schaller, 2020. "Efficient procedures for the weighted squared tardiness permutation flowshop scheduling problem," Flexible Services and Manufacturing Journal, Springer, vol. 32(3), pages 487-522, September.
    7. Frank Benda & Roland Braune & Karl F. Doerner & Richard F. Hartl, 2019. "A machine learning approach for flow shop scheduling problems with alternative resources, sequence-dependent setup times, and blocking," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(4), pages 871-893, December.
    8. Mati, Yazid & Dauzère-Pérès, Stèphane & Lahlou, Chams, 2011. "A general approach for optimizing regular criteria in the job-shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 212(1), pages 33-42, July.
    9. Schaller, Jeffrey & Valente, Jorge M.S., 2020. "Minimizing total earliness and tardiness in a nowait flow shop," International Journal of Production Economics, Elsevier, vol. 224(C).
    10. Anurag Agarwal & Varghese S. Jacob & Hasan Pirkul, 2006. "An Improved Augmented Neural-Network Approach for Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 18(1), pages 119-128, February.
    11. Alidaee, Bahram & Kochenberger, Gary A. & Amini, Mohammad M., 2001. "Greedy solutions of selection and ordering problems," European Journal of Operational Research, Elsevier, vol. 134(1), pages 203-215, October.
    12. Binzi Xu & Kai Xu & Baolin Fei & Dengchao Huang & Liang Tao & Yan Wang, 2024. "Automatic Design of Energy-Efficient Dispatching Rules for Multi-Objective Dynamic Flexible Job Shop Scheduling Based on Dual Feature Weight Sets," Mathematics, MDPI, vol. 12(10), pages 1-24, May.
    13. Parlakturk, Ali & Kumar, Sunil, 2004. "Self-Interested Routing in Queueing Networks," Research Papers 1782r, Stanford University, Graduate School of Business.
    14. Nascimento, Paulo Jorge & Silva, Cristóvão & Antunes, Carlos Henggeler & Moniz, Samuel, 2024. "Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems," European Journal of Operational Research, Elsevier, vol. 317(1), pages 92-110.
    15. S-W Lin & K-C Ying, 2008. "A hybrid approach for single-machine tardiness problems with sequence-dependent setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(8), pages 1109-1119, August.
    16. Maria Anna Huka & Christian Rindler & Manfred Gronalt, 2021. "Scheduling and loading problem for multiple, identical dry kilns," Flexible Services and Manufacturing Journal, Springer, vol. 33(2), pages 312-336, June.
    17. Xu, Jun & Wang, Jun-Qiang & Liu, Zhixin, 2022. "Parallel batch scheduling: Impact of increasing machine capacity," Omega, Elsevier, vol. 108(C).
    18. Valente, Jorge M.S., 2007. "Improving the performance of the ATC dispatch rule by using workload data to determine the lookahead parameter value," International Journal of Production Economics, Elsevier, vol. 106(2), pages 563-573, April.
    19. Zoghby, Jeriad & Wesley Barnes, J. & Hasenbein, John J., 2005. "Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches," European Journal of Operational Research, Elsevier, vol. 167(2), pages 336-348, December.
    20. Artur Alves Pessoa & Teobaldo Bulhões & Vitor Nesello & Anand Subramanian, 2022. "Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1512-1530, May.

    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:spr:opsear:v:57:y:2020:i:2:d:10.1007_s12597-019-00434-8. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.