主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

Chinese Journal of Management Science ›› 2018, Vol. 26 ›› Issue (4): 97-107.doi: 10.16381/j.cnki.issn1003-207x.2018.04.011

• Articles • Previous Articles     Next Articles

Collaborative Manufacturing Scheduling based on Improved Ant Colony Optimization Algorithm with Time Window Constraint

TANG Liang1,2, HE Jie2, JING Ke3, JIN Zhi-hong1   

  1. 1. Transportation Engineering College, Dalian Maritime University, Dalian 116026, China;
    2. School of Transportation, Southeast University, Nanjing 210096, China;
    3. School of Shipping Economic and Management, Dalian Maritime University, Dalian 116026, China
  • Received:2015-05-05 Revised:2016-03-10 Online:2018-04-20 Published:2018-06-22

Abstract: Since the collaborative and cooperative manufacturing mode is gaining popularity, which has the merit of utilizing superior resources in collaborative factories to improve production efficiency, thus it becomes important to do the study on scheduling in collaborative manufacturing mode. In a collaborative manufacturing mode, there are multiple processing paths that forming the collaborative manufacturing networks, and thus the corresponding networks are dynamic and changable. Additionally, different type products belong to different type collaborative manufacturing networks and this makes our model more complex. In light of that, four general types of collaborative manufacturing networks Gp are constructed and discussed, including balance type network, bottleneck type network, jump type network, and hybrid type network. Some pramaters of scheduling model are also designed to make problem more reasable, i.e., production cost function, earliest delivery time tfk and latest delivery time tlk. An objective function composed of processing costs Wcm, inventory costs Wsk(Qk, T'k), and the two penalty costs of early completion costs Wsk(Qk, Tk) and tardiness costs Wlk(Qk, T'″k) is then constructed. In order to solve our model, an improved ant colony optimization algorithm is presented, into which the Monte Carlo algorithm is incorporated. In particular, the upper confidence bound zi is used to guide the ant selection. Meanwhile, a moving window award mechanism[min, max] is also designed to improve award criteria. Given that the expectation window moves frequently with the increase of simulation, and thus the credible level of expectation window increases. In view of this, the fixed pheromone concentration should multiply a balance coefficient k(N) as the award value to improve the rewards credibility. The simulation results show that our designed model is reasonable and practical. Meanwhile, our proposed algorithm has fast solving speed, good convergence and stability. Our research work is benefit for enterprise scheduling in collaborative manufacturing mode.

Key words: collaborative manufacturing network, collaborative scheduling optimization, improved ant colony optimization algorithm, Monte Carlo method, supply chain scheduling

CLC Number: