Journal
JOURNAL OF PROJECT MANAGEMENT
Volume 8, Issue 3, Pages 177-190Publisher
GROWING SCIENCE
DOI: 10.5267/j.jpm.2023.3.001
Keywords
Parallel Machines Scheduling; Learning Effect; Deterioration effect; Past-Sequence-Dependent setup times; Augmented ?-constraint Method; VNS-NSGA II Hybrid Algorithm
Categories
Ask authors/readers for more resources
This research investigates non-identical parallel machine scheduling, taking into account the simultaneous consideration of learning effects, deterioration, and past-sequence-dependent setup times. A fuzzy nonlinear mathematical model with two objective functions is presented and solved using the fuzzy Chance Constraint Programming approach. To achieve an efficient near-optimal Pareto front, a hybrid NSGA-II and VNS multi-objective meta-heuristic is proposed and the results are discussed. The computational analysis demonstrates the effectiveness of this proposed algorithm in tackling problems, especially those with substantial dimensions.
The industry has expressed significant concern regarding the issue of parallel machines and the influence of learning and deterioration. This research investigates non-identical parallel machine scheduling, taking into account the simultaneous consideration of learning effects, deterioration, and past-sequence-dependent setup times. Due to the existence of uncertain parameters in real -world scenarios, the processing times and due dates are assumed to be triangular fuzzy numbers. A fuzzy nonlinear mathematical model with two objective functions is presented and solved using the fuzzy Chance Constraint Programming approach. The two objectives are the summa-tion of earliness and tardiness, as well as makespan. To achieve an efficient near-optimal Pareto front for the problem, a hybrid NSGA-II and VNS multi-objective meta-heuristic is proposed and the results are discussed. Finally, the augmented epsilon-constraint method is utilized to address issues with small dimensions. The computational analysis demonstrates the effectiveness of this proposed algorithm in tackling problems, especially those with substantial dimensions.(c) 2023 Growing Science Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available