API-based two-dimensional dispatching decision-making approach for semiconductor wafer fabrication with operation due date–related objectives
提出一种基于相邻成对交换的二维调度方法，在机器空闲时选择作业并分配开始时间，以最小化工序交期偏差，并通过启发式算法提高求解效率，仿真验证优于四种常见调度规则。
This paper presents an adjacent pairwise interchanges (API)-based two-dimensional dispatching decision-making approach for semiconductor wafer fabrication with operation due date-related objectives. Each time when a machine becomes idle, the proposed dispatcher chooses a target processing job from the competing jobs and assigns it a start time. Giving the operation due date information of each competing job, we formulate this dispatcher as the mean absolute deviation problem to keep the jobs finished around their operation due dates in a proactive way. Dominance properties of this problem are established using proof by APIs. Then, a heuristic comprised of job selection within candidate set, movement of job cluster and local search is designed to solve this problem more efficiently. Numerical experiments validate the efficiency of the proposed heuristic in a single-machine environment as well as in a simulated wafer fab abstracted from practice. In comparison with four most referenced due date-related dispatching rules, the simulation study reveals the benefits brought by the two-dimensional dispatching decision with different due date tightness taken into account.