Schedule Grouped Jobs on Parallel Machines with Single Mold Constraint
Gao Lin
Wang Dingwei
Wang Shuning
Abstract：This paper addresses the problem of scheduling n grouped jobs on m identical parallel machines to minimize the total tardiness, subject to single mold constraint. For this problem, there is an optimal solution without machine idle. Thus, the scale of searching for optimal solution is reduced. Branch and bound algorithm, run-based heuristic, multi-stage tabu search and a combined algorithm are proposed and compared in simulation experiments. Some practically useful results are obtained.
Keywords：production schedulingparallel machinegroup technology
Publication Date：1999-10-20
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)