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.
A simulated multi-objective model for flexible job shop transportation scheduling
Ann Oper Res
Annals of Operations Research ; 311 , 2 ; 899-920
2022-04-01
22 pages
Article (Journal)
Electronic Resource
English
Shop-scheduling problems with transportation
TIBKAT | 1999
|Two-Stage Hybrid Pareto Ant Colony Algorithm for Multi-Objective Flexible Job Shop Scheduling
British Library Online Contents | 2016
|Trans Tech Publications | 2014
|British Library Online Contents | 2017
|Improved Simulated Annealing Algorithm Used for Job Shop Scheduling Problems
Springer Verlag | 2012
|