This paper proposes a new dynamic algorithm based on simulation approach and multi-objective optimization to solve the FJSP with transportation assignment. The objectives considered in scheduling jobs and transportation tasks in a flexible job shop manufacturing system include makespan, robot travel distance, time difference with due date and critical waiting time. The results obtained from the computational experiments have shown that the proposed approach is efficient and competitive.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A simulated multi-objective model for flexible job shop transportation scheduling


    Additional title:

    Ann Oper Res


    Contributors:

    Published in:

    Publication date :

    2022-04-01


    Size :

    22 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English





    Two-Stage Hybrid Pareto Ant Colony Algorithm for Multi-Objective Flexible Job Shop Scheduling

    Zhao, Boxuan / Gao, Jianmin / Chen, Kun | British Library Online Contents | 2016


    Reactive Scheduling of a Decentralized Multi-Objective Material Transportation Tasks in a Dynamic Job Shop Manufacturing System

    bin Md Fauadi, Muhammad Hafidz Fazli ;Azni Jafar, Fairul ;Saptari, Adi | Trans Tech Publications | 2014


    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


    Improved Simulated Annealing Algorithm Used for Job Shop Scheduling Problems

    Song, Shao-zhong / Ren, Jia-jun / Fan, Jia-xu | Springer Verlag | 2012