Title
Dynamic parts scheduling in multiple job shop cells considering intercell moves and flexible routes
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.
Year
DOI
Venue
2013
10.1016/j.cor.2012.11.024
Computers & OR
Keywords
Field
DocType
ant colony optimization,global performance,various type,negotiation complexity,computational result,intercell move,dynamic part,communication cost,maximum completion time,various heuristics,flexible route,multiple job shop cell,mean flow time,coalition agent
Mathematical optimization,Scheduling (computing),Job shop,Multi-agent system,Mathematics,Distributed computing
Journal
Volume
Issue
ISSN
40
5
0305-0548
Citations 
PageRank 
References 
9
0.54
20
Authors
4
Name
Order
Citations
PageRank
Dongni Li1101.92
Yan Wang290.54
guangxue xiao390.88
Jiafu Tang454149.29