A New Neighborhood for the Job Shop Scheduling Problem

被引：0

作者：

Nasiri, Mohammad Mandi ^{[1
]}

Kianfar, Farhad ^{[1
]}

机构：

[1] Sharif Univ Technol, Dept Ind Engn, Tehran, Iran

来源：

MATERIALS SCIENCE AND INFORMATION TECHNOLOGY, PTS 1-8 | 2012年 / 433-440卷

关键词：

scheduling; mixed shop; general shop; stage shop; TABU SEARCH ALGORITHM;

D O I：

10.4028/www.scientific.net/AMR.433-440.1540

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

The effectiveness of the local search algorithms for shop scheduling problems is proved frequently. Local search algorithms like tabu search use neighborhood structures in order to obtain new solutions. This paper presents a new neighborhood for the job shop scheduling problem. In this neighborhood, few enhanced conditions are proposed to prevent cycle generation. These conditions allow that the neighborhood encompasses larger number of solutions without increasing the order of computational efforts.

引用

页码：1540 / 1544

页数：5

共 50 条

[1] New neighborhood structure for job shop scheduling problem
Gui, Lin
Li, Xinyu
Gao, Liang
[J]. Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2021, 49 (07): : 103 - 106
[2] A new neighborhood structure for the job shop scheduling problem
Yin, AH
[J]. PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2004, : 2098 - 2101
[3] Global neighborhood algorithm for Job Shop scheduling problem
Cui, Jian-Shuang
Li, Tie-Ke
[J]. Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2009, 15 (07): : 1383 - 1388
[4] A new neighborhood structure for solving the flexible job-shop scheduling problem
Huang, Xuewen
Chen, Shaofen
Zhou, Tianyu
Sun, Yuting
[J]. Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, 2021, 41 (09): : 2367 - 2378
[5] A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
Zhang, ChaoYong
Li, PeiGen
Guan, ZaiLin
Rao, YunQing
[J]. COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (11) : 3229 - 3242
[6] A hybrid heuristic neighborhood algorithm for the job shop scheduling problem
Cui, Jianshuang
Li, Tieke
[J]. ICNC 2008: FOURTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 6, PROCEEDINGS, 2008, : 412 - 416
[7] The new golf neighborhood for the flexible job shop problem
Bozejko, Wojciech
Uchronski, Mariusz
Wodecki, Mieczyslaw
[J]. ICCS 2010 - INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, PROCEEDINGS, 2010, 1 (01): : 289 - 296
[8] Impact of Encoding and Neighborhood on Landscape Analysis for the Job Shop Scheduling Problem
Tsogbetse, Israel
Bernard, Julien
Manier, Herve
Manier, Marie-Ange
[J]. IFAC PAPERSONLINE, 2022, 55 (10): : 1237 - 1242
[9] ORDER ACCEPTANCE AND JOB SHOP SCHEDULING: A NEW NEIGHBORHOOD SEARCH
Lei, De-Ming
Cao, San-Qiang
[J]. 2017 CHINESE AUTOMATION CONGRESS (CAC), 2017, : 84 - 89
[10] A hybrid algorithm based on a new neighborhood structure evaluation method for job shop scheduling problem
Gao, Liang
Li, Xinyu
Wen, Xiaoyu
Lu, Chao
Wen, Feng
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2015, 88 : 417 - 429

← 1 2 3 4 5 →