Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
