An algorithm based on discrete shuffled frog leaping for No-idle permutation flow shop scheduling problem

Beijing Gongye Daxue Xuebao / Journal of Beijing University of Technology

Volumn 36, Issue 1, 2010, Pages 124-130

  Wang, Ya Min ^a,b   Ji, Jun Zhong ^a   Pan, Quan Ke ^b  

^a BEIJING UNIVERSITY OF TECHNOLOGY   (China)

^b LIAOCHENG UNIVERSITY   (China)

Author keywords

Discrete shuffled frog leaping algorithm; Neighborhood search; No idle flow shop

Indexed keywords

DIFFERENT SCALE; DISCRETE SHUFFLED FROG LEAPING ALGORITHM; ENCODING SCHEMES; FLOW-SHOPS; NEIGHBORHOOD SEARCH; PERMUTATION FLOW-SHOP SCHEDULING; SHUFFLED FROG LEAPING;

MACHINE SHOP PRACTICE;

ALGORITHMS;

EID: 77951006087     PISSN: 02540037     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (9)

1. -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: A problem 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 flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm[J]. The International Journal of Advanced Manufacturing Technology, 2008, 39(7-8): 796-807.
6. 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.
7. 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.
8. Elbeltagi E, Hegazy T, Grierson D. Comparison among five evolutionary-based optimization algorithm[J]. Advanced Engineering Informatics, 2005, 19(1): 43-53.
9. 2001, 10.