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

Abstract

Previously, minimizing total flow time in the model of an identical, parallel machines with nonpreemptive jobs has been investigated. Because the specific problem has been shown as NP-complete, heuristics have been developed for solving it. A shortest processing time for Ai part (SPT-A) heuristic is used for the job scheduling subproblem. In addition, the largest marginal contribution (LMC) procedure is used for the worker assignment subproblem and then minimizes the total flow time. Different values of W (number of workers) are used for further study of the performance of these heuristics developed. In conclusion, for the simplified processing time function, values of W have no significant influence when the heuristics are applied. In other words, no matter what value of W was used when SPT rule was applied, the heuristics generate the same, excellent results.