NSGA-II variants for solving a social-conscious dual resource-constrained scheduling problem
NSGA-II variants for solving a social-conscious dual resource-constrained scheduling problem
复制标题
DOI:
10.1016/j.eswa.2020.113754
复制
发表时间:
2020-12
期刊:
影响因子:
--
通讯作者:
Muhammad Akbar;T. Irohara
中科院分区:
文献类型:
--
作者:
Muhammad Akbar;T. Irohara
This present study compares various non-dominated sorting genetic algorithm II (NSGA-II) variants to deal with multi-task simultaneous supervision dual resource-constrained (MTSSDRC) scheduling to minimize the makespan and workload unbalance among operators. MTSSDRC is a complex problem that needs to integrate two types of scheduling, ie, job sequencing on the machines and task sequencing, which includes setup, unloading, and moving, by the operators. Since there are two resources, one may be busier than the other. Task sequencing should be prioritized if the operator is very busy, otherwise, we should accentuate the job sequencing. The existing NSGA-II variant prioritizes the machine assignment over the operator. Therefore, its performance is not so well when the operator-to-machine ratio is small. Thus, this proposed research develops two new NSGA-II variants identified by their modified decoding schemes. They posit the operator more important or at least equal to the machine. To the best of our knowledge, this research is the first to analyze MTSDDRC based on the operator-to-machine ratio. The essential finding insists that each variant fits the specific ratio. The new ones are promising for cases with a ratio⩽ 0.5. Otherwise, the existing variant is still recommended. Besides, one of the new decoding schemes performs well for all ratio, but not the best.