Further study of minimizing total tardiness for the worker assignment scheduling problem in the identical parallel-machine models

Abstract

Minimizing total tardiness in the model of an identical parallel-machine with nonpreemptive jobs of the worker assignment scheduling problem is further studied in this paper. More complicated simulation processes are established for this purpose. The specific worker assignment scheduling problem is solved in two parts of job scheduling and worker assignment. The SPT, EDD, Slack (SES) heuristic is used for the job scheduling part while the largest marginal contribution (LMC) procedure is used to for the worker assignment part and then minimizes the total tardiness. From the new simulations conducted, the heuristics developed have again shown very convincing results quite efficiently. tween them. In addition, a new and more suitable performance measure will be introduced.

Minimizing total tardiness subject to manpower restriction in labor-intensive manufacturing cells

“…Hu [23] studied the total tardiness problem with worker assignment for parallel machines using heuristics for both job scheduling and worker assignment. For job scheduling, the Shortest Processing Time (SPT), Earliest Due Date (EDD) and the Slack heuristics were used whereas the largest marginal contribution (LMC) procedure was used for worker assignment.…”