The single-factory manufacturing is gradually transiting to the multi-factory collaborative production with the globalization. The decentralization of resources and the heterogeneity of the production modes make it di...
详细信息
The single-factory manufacturing is gradually transiting to the multi-factory collaborative production with the globalization. The decentralization of resources and the heterogeneity of the production modes make it difficult to solve this kind of problem. Therefore, the distributed assembly flexible job shop scheduling problem (DAFJSP) is studied. DAFJSP can be decomposed into several flexible job shop scheduling problems and several single machine factory scheduling problems. To begin with, a mixed integer linear programming model for the DAFJSP is formulated to minimize the earliness/tardiness and the total cost simultaneously. Then, an improved differential evolution simulated annealing algorithm (IDESAA) is proposed. The balanced scheduling algorithm is designed to trade off the two objectives. Two crossover and mutation operators are designed. Due to its strong robustness, simulated annealing is integrated to local search the best Pareto solutions. The greedy idea combined with the Non-Dominated Sorted selection is employed to select the offspring. Finally, comprehensive experiments are conducted and the results show that the proposed algorithm can solve DAFJSP effectively and efficiently.
The number of fragments generated between adjacent networks is derived for different fragmentation schemes. This result is extended to cover fragmentation over more complex transnetwork systems. This allows the calcul...
详细信息
The number of fragments generated between adjacent networks is derived for different fragmentation schemes. This result is extended to cover fragmentation over more complex transnetwork systems. This allows the calculation of the number of fragments received at a packet destination. The effects of fragmentation on the receiver are examined using a simple model of packet processing.
暂无评论