The parallel machine scheduling problem with time windowsParallel machine scheduling problem with time windows (PMSP-TW) belongs to a category of production scheduling problems. Due to the time windowTime window characteristics of each machine, it becomes difficult to solve this problem. For the PMSPParallel machine scheduling problem with time windows-TW problem, we proposedDual-population Bees Algorithma dual-populationDual-populationBees AlgorithmBees Algorithm. Two types of search populations and supplementary populations are set in the Bees AlgorithmBees Algorithm, THE. The propose of dual populationsDual-population is mainly aimed at the situation of poor convergence performance of the traditional Bees Algorithm. If the optimization process is inefficient, the population to which the food source belongs will be updated through the population performance evaluation. Experiments can verify the schedulingScheduling effect of our proposed algorithm.
Application of the Dual-population Bees Algorithm in a Parallel Machine Scheduling Problem with a Time Window
Springer Ser.Advanced Manufacturing
Intelligent Production and Manufacturing Optimisation—The Bees Algorithm Approach ; Chapter : 14 ; 229-242
2022-11-20
14 pages
Article/Chapter (Book)
Electronic Resource
English
BicriteriaHeuristic for Unrelated Parallel Machine Scheduling Problem
British Library Conference Proceedings | 2014
|Transportation Research Record | 2009
|Minimizing the Makespan in Nonpreemptive Parallel Machine Scheduling Problem
British Library Online Contents | 2010
|