Performance Evaluation of ATC based Greedy Heuristic Algorithms in Scheduling Diffusion Furnace in Wafer Fabrication

This study addresses the scheduling of a Batch Processing Machine (BPM) with incompatible job-families, dynamic job-arrivals, and non-agreeable release times & due dates with the objective of minimizing total weighted tardiness (TWT). First we propose a mixed integer linear programming model (MI...

Full description

Saved in:
Bibliographic Details
Published inJournal of information & optimization sciences Vol. 37; no. 5; pp. 717 - 762
Main Authors Vimala Rani, M., Mathirajan, M.
Format Journal Article
LanguageEnglish
Published Taylor & Francis 02.09.2016
Subjects
Apparent Tardiness Cost
Batch Processing Machine
Estimated Optimal Solution
Greedy Heuristic Algorithm
Incompatible Job-Families
MILP Model
Total Weighted Tardiness
Online AccessGet full text

Cover

More Information
Summary:This study addresses the scheduling of a Batch Processing Machine (BPM) with incompatible job-families, dynamic job-arrivals, and non-agreeable release times & due dates with the objective of minimizing total weighted tardiness (TWT). First we propose a mixed integer linear programming model (MILP) for the research problem. Due to the computational intractability in getting optimal solution for large scale real-life sized problems, we propose nine variants of Apparent Tardiness Cost (ATC) based greedy heuristic algorithms (GHA). From the series of computational experiments carried out it is observed that out of nine ATC based GHA, two proposed variants of ATC based GHA consistently performing better than other variants of ATC based GHA in comparison with an estimated optimal solution.
ISSN:0252-2667
2169-0103
DOI:10.1080/02522667.2016.1191187