A mathematical model is developed for the dual resource constrained flexible job-shop scheduling problem (DRCFJSP), considering worker proficiency and preparation times of jobs on machines with the objective of minimizing the maximum completion time. The model incorporates variations in worker skills and proficiency levels. To address the problem’s complexity, a genetic algorithm (GA) is employed for solution generation. Finally, comparative experiments are conducted using simulation scenarios, validating that integrating the impact of worker proficiency on preparation times into the scheduling model significantly optimizes total production completion time.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A Genetic Algorithm for the Dual Resource Constrained Flexible Job Shop Scheduling Problem Considering Preparation Times


    Contributors:
    Fan, Di (author) / Wang, Chuang (author)


    Publication date :

    2024-08-23


    Size :

    1522207 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Hybrid multiagent genetic algorithm for job shop scheduling problem

    Li, Xiaotao / Peng, Chong | British Library Online Contents | 2017


    A Genetic Algorithm-Based Approach for Flexible Job Shop Scheduling

    Phanden, R.K. / Jain, A. / Verma, R. | British Library Conference Proceedings | 2012


    A hybrid particle swarm optimisation for multi-objective flexible job-shop scheduling problem with dual-resources constrained

    Zhang, Jing / Jie, Jing / Wang, Wanliang et al. | British Library Online Contents | 2017