The worker assignment scheduling problem consists of two basic questions of job scheduling and worker assignment. In this study, only the performance measure of total flow time is investigated in the model of identical parallel-machine with nonpreemptive jobs. Because the worker assignment scheduling problem in this specific model can be shown as NP-complete, heuristics have been developed for minimizing the total flow time. This selected worker assignment scheduling problem is solved in two stages of job scheduling and worker assignment. The shortest processing time for A i part (SPT-A) heuristic is used for the stage of job scheduling. For the stage of worker assignment, the largest marginal contribution (LMC) procedure is used to minimize the total flow time. Two 100 I/P/n/m/W problems were simulated; results obtained by the heuristics are either optimal or near optimal. In conclusion, the heuristics developed have shown very impressive results quite efficiently.
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.
The worker assignment scheduling problem involves both the decisions of job scheduling and worker assignment. In this research, only the performance measure of total tardiness is investigated in the model of identical parallel machines with nonpreemptive jobs. Since the worker assignment scheduling problem in the selected model can be shown to be NP-complete, heuristics have been developed for minimising the total tardiness. The worker assignment scheduling problem is solved in two phases of job scheduling and worker assignment. The SES (SPT, EDD, SLACK) heuristic is used for the phase of job scheduling. For the phase of worker assignment, the largest marginal contribution (LMC) procedure is used to minimise the total tardiness. From the simulation conducted, 88 out of 100 simulated problems yielded optimal solutions while the others also obtained very good results. In conclusion, the heuristics developed have shown very impressive results in both effectiveness and efficiency aspects.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations鈥揷itations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.