Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness

Abstract

We study a parallel machine scheduling problem, where a job j can only be processed on a specific subset of machines Mj, and the Mj subsets of the n jobs are nested. We develop a two‐phase heuristic for minimizing the total weighted tardiness subject to the machine eligibility constraints. In the first phase, we compute the factors and statistics that characterize a problem instance. In the second phase, we propose a new composite dispatching rule, the Apparent Tardiness Cost with Flexibility considerations (ATCF) rule, which is governed by several scaling parameters of which the values are determined by the factors obtained in the first phase. The ATCF rule is a generalization of the well‐known ATC rule which is very widely used in practice. We further discuss how to improve the dispatching rule using some simple but powerful properties without requiring additional computation time, and the improvement is quite satisfactory. We apply the Sequential Uniform Design Method to design our experiments and conduct an extensive computational study, and we perform tests on the performance of the ATCF rule using a real data set from a large hospital in China. We further compare its performance with that of the classical ATC rule. We also compare the schedules improved by the ATCF rule with what we believe are Near Optimal schedules generated by a general search procedure. The computational results show that especially with a low due date tightness, the ATCF rule performs significantly better than the well‐known ATC rule generating much improved schedules that are close to the Near Optimal schedules. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 249–267, 2017

An exact quadratic programming approach based on convex reformulation for seru scheduling problems

“…Şen and Bülbül (2015) formulated the weighted tardiness and earliness/tardiness problem on unrelated parallel machines as a mixed-integer linear program and devised a computationally effective Benders decomposition algorithm to solve the proposed model with strong preemptive relaxation after providing a tight lower bound. Su et al (2017) developed a two-phase heuristic for minimizing the total weighted tardiness subject to the machine eligibility constraints in the PMS problem and performed tests using a real dataset from a large hospital in China. Kramer and Subramanian (2019) designed a unified heuristic algorithm for a large class of earliness-tardiness scheduling problems in the single/parallel machine, and tested in thousands of instances of several earliness-tardiness scheduling problems and particular cases to show the good performance of proposed algorithm.…”

Effective and interpretable dispatching rules for dynamic job shops via guided empirical learning

“…Similarly, Jain and Foley (2016) conclude that under high load levels and long interruptions, the rules work better than adapting a complete schedule. Effective DRs have been developed for different problems, such as the classical job shops (Chen and Matis, 2013), shops with batch release (Xiong et al, 2017) and parallel machines (Su et al, 2017). The applications are not limited to manufacturing.…”