Integrated Search Method for Flexible Job Shop Scheduling Problem Using HHS–ALNS Algorithm

被引：0

作者：

Anand Deva Durai C. ^{[1
]}

Azath M. ^{[1
]}

Jeniffer J.S.C. ^{[2
]}

机构：

[1] College of Computer Science, King Khalid University, Abha

[2] Department of Computer Science and Engineering, Aringer Anna College of Engineering and Technology, Palani

来源：

SN Computer Science | 2020年 / 1卷 / 2期

关键词：

Flexible job shop scheduling; Harmony search; Large neighborhood search; Makespan;

D O I：

10.1007/s42979-020-0084-y

中图分类号：

学科分类号：

摘要：

Classical job shop scheduling problems took many forms over decades out of which the prominent one is flexible job shop scheduling problem (FJSP), where any machine from a given set, rather than one specific machine can process each operation. To form a stronger search mechanism and better scheduling, an integrated search heuristic given as integrated HHS–ALNS, where the local search in hybrid harmony search (HHS) is replaced by adaptive large neighborhood search (ALNS), is proposed for the FJSP. In ALNS, a weight associated with every operation is adjusted during the end of search segments based on its previous behaviors and violation of capacity constraints. By using this proposed method, the performance is improved a lot in terms of makespan. © 2020, Springer Nature Singapore Pte Ltd.

引用

共 14 条

[1]

Fattahi P., Jolai F., Arkat J., Flexible job shop scheduling with overlapping-in operations, Appl Math Modell, 33, pp. 3076-3087, (2009)

[2]

Yuan Y., Xu H., HHS/LNS: An integrated search method for flexible job shop scheduling, IEEE Congress on Evolutionary Computation, (2012)

[3]

Nowicki E., Smutnicki C., An advanced tabu search algorithm for job shop problem, J Sched, 8, pp. 145-159, (2005)

[4]

Huang K.L., Liao C.J., Ant colony optimization combined with taboo search for the job shop scheduling problem, Comput Oper Res, 35, pp. 1030-1046, (2008)

[5]

Brandimarte P., Routing and scheduling in a flexible job shop by tabu search, Ann Oper Res, 41, pp. 157-183, (1993)

[6]

Wang L., Zhou G., Xu Y., Wang S., Liu M., An effective artificial bee colony algorithm for the flexible job-shop scheduling problem, Int J Adv Manuf Technol, 60, pp. 303-315, (2012)

[7]

Geem Z., Kim J., Loganathan G., A new heuristic optimization algorithm: harmony search, Simulation, 76, (2001)

[8]

Park B.J., Choi H.R., Kim H.S., A hybrid genetic algorithm for the job shop scheduling problems, Comput Ind Eng, 45, pp. 597-613, (2003)

[9]

Mollaei H.R., Zeynali S., Pour N.S., Solving the multi objective flexible job shop problem using combinational meta heuristic algorithm based on genetic algorithm and tabu-search, J Basic Appl Sci Res, 3, 9, pp. 713-720, (2013)

[10]

Gao J., Sun L., Gen M., A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems, Comput Oper Res, 35, pp. 2892-2907, (2008)

← 1 2 →