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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Application of the Dual-population Bees Algorithm in a Parallel Machine Scheduling Problem with a Time Window


    Additional title:

    Springer Ser.Advanced Manufacturing


    Contributors:


    Publication date :

    2022-11-20


    Size :

    14 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English





    BicriteriaHeuristic for Unrelated Parallel Machine Scheduling Problem

    Lin, Y.K. / Lin, H.C. | British Library Conference Proceedings | 2014



    Adaptive Algorithm Based on Time Window Partitioning for Discrete and Dynamic Berth-Scheduling Problem

    Golias, Mihalis M. / Boile, Maria / Theofanis, Sotiris | Transportation Research Record | 2009


    Minimizing the Makespan in Nonpreemptive Parallel Machine Scheduling Problem

    Chiaselotti, G. / Gualtieri, M. I. / Pietramala, P. | British Library Online Contents | 2010