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

作     者：Rani, M. Vimala Mathirajan, M. 

作者机构：Indian Inst Sci Dept Management Studies Bangalore 560012 Karnataka India 

出 版 物：《JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES》 

年 卷 期：2016年第37卷第5期

页      面：717-762页

学科分类：1205[管理学-图书情报与档案管理] 07[理学] 070104[理学-应用数学] 0701[理学-数学] 

主　　题：Batch Processing Machine Incompatible Job-Families Apparent Tardiness Cost Total Weighted Tardiness MILP Model Greedy Heuristic Algorithm Estimated Optimal Solution 

摘      要：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.