The new golf neighborhood for the flexible job shop problem

被引:27
作者
Bozejko, Wojciech [2 ]
Uchronski, Mariusz [2 ]
Wodecki, Mieczyslaw [1 ]
机构
[1] Univ Wroclaw, Inst Comp Sci, Joliot Curie 15, PL-50383 Wroclaw, Poland
[2] Wroclaw Univ Technol, Inst Comp Engn Control & Robot, PL-50372 Wroclaw, Poland
来源
ICCS 2010 - INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, PROCEEDINGS | 2010年 / 1卷 / 01期
关键词
scheduling; flexible job shop; metaheuristics; SCHEDULING PROBLEM; TABU SEARCH; ALGORITHM;
D O I
10.1016/j.procs.2010.04.032
中图分类号
TP301 [理论、方法];
学科分类号
080201 [机械制造及其自动化];
摘要
In this paper we propose a new neighborhood for the flexible job shop problem. A main idea of the proposed neighborhood is to execute a 'long shot' of an operation from the current operation's machine to another machine of the same type, and then to the make a small move by using a local optimization algorithm without changing operations-to-machines assignment. We call this method 'the golf neighborhood'. Computational experiments executed on the benchmark instances from the literature show the efficiency of this solution.
引用
收藏
页码:289 / 296
页数:8
相关论文
共 23 条
[1]
ADRABINSKI A, 1979, ZASTOSOW MAT, V16, P513
[2]
Alba E, 2005, WILEY SER PARA DIST, P1, DOI 10.1002/0471739383
[3]
[Anonymous], INT J INTELLIGENT MA
[4]
[Anonymous], 1996, TECHNICAL REPORT SER
[5]
BOZEJKO W, COMPUTERS IND UNPUB
[6]
BOZEJKO W, 2007, THEORETICAL PROPERTI, V35, P227
[7]
Solving permutational routing problems by population-based metaheuristics [J].
Bozejko, Wojciech ;
Wodecki, Mieczyslaw .
COMPUTERS & INDUSTRIAL ENGINEERING, 2009, 57 (01) :269-276
[8]
Brandimarte P., 1993, Annals of Operations Research, V41, P157, DOI 10.1007/BF02023073
[9]
Cormen T., 2001, Introduction to Algorithms
[10]
An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search [J].
DauzerePeres, S ;
Paulli, J .
ANNALS OF OPERATIONS RESEARCH, 1997, 70 (0) :281-306