[1]Cristóbal Miralles, José P.GarcíaSabater, Carlos Andrés, et al. Branch and bound procedures for solving the assembly line worker assignment and balancing problem: application to sheltered work centers for disabled[J].Discrete Applied Mathematics, 2008, 156(3): 352-367.
[2]Joaquín Bautista, Jordi Pereira. A dynamic programming based heuristic for the assembly line balancing problem[J]. European Journal of Operational Research, 2009, 194(3): 787-794.
[3]Armin Scholl,Christian Becker. Stateoftheart exact and heuristic solution procedures for simple assembly line balancing[J]. European Journal of Operational Research, 2006, 168: 666-693.
[4]何善平, 奚立峰. 发动机装配线平衡方法研究[J]. 工业工程,2005,8(3):83-88.
[5]徐炜达, 肖田元. 可跨工位操作的随机混流装配线平衡问题研究[J]. 系统仿真学报,2009,21(18):5896-5901.
[6]秦永法,赵明扬,陈书宏. 基于遗传退火算法的装配线设计多目标优化方法[J]. 计算机集成制造系统,2004,10(11):1416-1420.
[7]Sophie D. Lapierre, Angel Ruiz, Patrick Soriano. Balancing assembly lines with tabu search[J]. European Journal of Operational Research, 2006, 168(3): 826-837.
[8]Stefan Bock, Otto Rosenberg. A new parallel breadth first tabu search technique for solving production planning problems[J]. International Transactions in Operational Research, 2000, 7(6): 625-635.
[9]Christian Becker, Armin Scholl. A survey on problems and methods in generalized assembly line balancing[J]. European Journal of Operational Research, 2006, 168(3): 694-715.
[10]Gavriel Salvendy. 工业工程手册:第1分册[M]. 北京:清华大学出版社,2005:264-270.
[11]刘胜军. 精益生产方式现场IE[M]. 深圳:海天出版社,2002:172-180.
[12]Michael Laszlo,Sumitra Mukherjee. A genetic algorithm that exchanges neighboring centers for kmeans clustering[J]. Pattern Recognition Letters, 2007, 28(16): 2359-2366. |