Abstract
Aiming at the problem of scheduling with flexible processing routes and exceptional parts that need to visit machines located in multiple job shop cells, a pheromone based approach (PBA) using multi-agent is presented in this paper, in which various types of pheromone inspired by ant colony optimization (ACO) are adopted as the basis of negotiation among agents. By removing redundant routes and constructing coalition agents, communication cost and negotiation complexity are reduced, and more importantly, the global performance of scheduling is improved. The performance of the PBA is evaluated via experiments with respect to the mean flow time, maximum completion time, mean tardiness, ratio of tardy parts, and ratio of intercell moves. Computational results show that compared with various heuristics, the PBA has significant advantages with respect to the performance measures considered in this paper.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
