SAADANI N E I,GUINET A,MOALA M.A traveling salesman approach to solve the f/no-idle/cmax problem[J].European Journal of Operation Research,2005,161:11-20.
[2]
SAADANI N E H,BAPTISETE P,MOALLA M.The simple F2∥Cmax with forbiddden tasks in first or last position:Aproblem more complex than it seems[J].Eur J Oper Res,2005,161:21-31.
[3]
KALCZYNSKI P J,KAMBUROWSKI J.A heuristic for minimizing the makespan in no-idle permutation flow shop[J].Comput Ind Eng,2005,49:146-154.
[4]
BZRAZ D,MOSHEIOV G.A note on a greedy heuristic for the flow-shop makespan minimization with no machine idle-time[J].Eur J Oper Res,2008,184(2):810-813.
[5]
PAN Quan-ke,WANG Ling.No-idle permutation flowshop scheduling based on a hybrid discrete particle swarm optimizationalgorithm[J].The International Journal of Advanced Manufacturing Technology,2008,39(7-8):796-807.
[6]
王凌.智能优化算法及其应用[M].北京:清华大学出版社,2001,10.
[7]
PAN Quan-ke,WANG Ling.A novel differential evolution algorithm for no-idle permutation flow-shop scheduling problems[J].European J.of Industrial Engineering,2008,2(3):279-297.
[8]
EUSUFF M M,LANSEY K E.Optimization of water distribution network design using the shuffled frog leaping algorithm[J].Water Resour Plan Manage,2003,129(3):210-225.
[9]
ELBELTAGI E,HEGAZY T,GRIERSOND.Comparison among five evolutionary-based optimization algorithm[J].AdvancedEngineering Informatics,2005,19(1):43-53.
