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

M. Vimala Rani () and M. Mathirajan ()
Additional contact information
M. Vimala Rani: Indian Institute of Technology-Kharagpur
M. Mathirajan: Indian Institute of Science, Bangalore

OPSEARCH, 2020, vol. 57, issue 2, No 11, 462-512

Abstract: 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.

Keywords: Batch processing machine; Greedy heuristic algorithm; Dynamic scheduling; Due-date based dispatching rule; Due-date based scheduling objectives (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s12597-019-00434-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:opsear:v:57:y:2020:i:2:d:10.1007_s12597-019-00434-8

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/12597

DOI: 10.1007/s12597-019-00434-8

Access Statistics for this article

OPSEARCH is currently edited by Birendra Mandal

More articles in OPSEARCH from Springer, Operational Research Society of India
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().