Bi-criteria SDST hybrid flow shop scheduling with learning effect of setup times: water flow-like algorithm approach

被引:37
作者
Pargar, F. [2 ]
Zandieh, M. [1 ]
机构
[1] Shahid Beheshti Univ, Dept Ind Management, Management & Accounting Fac, GC, Tehran, Iran
[2] Mazandaran Univ Sci & Technol, Dept Ind Engn, Babol Sar, Iran
关键词
hybrid flow shop scheduling; meta-heuristics; water flow-like algorithm; learning effect; mathematical programming model; Taguchi experimental design; MINIMIZE; MAKESPAN; NUMBER; JOBS;
D O I
10.1080/00207543.2010.546380
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In studies on automatic scheduling problems, processing times do not differ according to repetition of job or process sequences so it may also be necessary to consider processing times independent from setup times. While considering setup times, the human factor has an important effect on setup, so by the processing of similar tasks frequently worker skills improve and they are able to perform setup at a greater pace. This fact is known as the 'learning effect' in the literature. This paper deals with sequence-dependent setup times (SDSTs) hybrid flow shop scheduling with learning effect of setup times for minimising weighted sum of makespan and total tardiness. A mathematical programming model that incorporates these aspects of the problem is developed which belongs to the NP-hard class. Thus, because of the intensive computation, we propose a novel meta-heuristic approach called water flow-like algorithm (WFA) which has the feature of multiple and dynamic numbers of solution agents. Various parameters of the problem and the WFA are reviewed by means of Taguchi experimental design. For the evaluation of the proposed WFA, problem data was generated to compare it against a random key genetic algorithm (RKGA). The results demonstrate the high performance of the WFA with respect to the RKGA.
引用
收藏
页码:2609 / 2623
页数:15
相关论文
共 27 条
[1]   Single-machine scheduling with learning considerations [J].
Biskup, D .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 115 (01) :173-178
[2]   Single machine scheduling with learning effect considerations [J].
Cheng, TCE ;
Wang, GQ .
ANNALS OF OPERATIONS RESEARCH, 2000, 98 (1-4) :273-290
[3]   Scheduling algorithms to minimize the number of tardy jobs in two-stage hybrid flow shops [J].
Choi, Hyun-Seon ;
Lee, Dong-Ho .
COMPUTERS & INDUSTRIAL ENGINEERING, 2009, 56 (01) :113-120
[4]   Flowshop scheduling with identical jobs and uniform parallel machines [J].
Dessouky, MM ;
Dessouky, MI ;
Verma, SK .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 109 (03) :620-631
[5]   A bicriteria flowshop scheduling with a learning effect [J].
Eren, Tamer ;
Guner, Ertan .
APPLIED MATHEMATICAL MODELLING, 2008, 32 (09) :1719-1733
[6]   Minimizing total tardiness in a scheduling problem with a learning effect [J].
Eren, Tamer ;
Guner, Ertan .
APPLIED MATHEMATICAL MODELLING, 2007, 31 (07) :1351-1361
[7]   THE 2-MACHINE SEQUENCE DEPENDENT FLOWSHOP SCHEDULING PROBLEM [J].
GUPTA, JND ;
DARROW, WP .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1986, 24 (03) :439-446
[8]  
Johnson S.M., 1954, NAVAL RES LOGISTICS, V1, P61, DOI [DOI 10.1002/NAV.3800010110, 10.1002/nav.3800010110]
[9]  
Jungwattanakit J., 2008, INT J ADV MANUF TECH, V37, P354
[10]   Minimizing the makespan in a single machine scheduling problem with a time-based learning effect [J].
Kuo, WH ;
Yang, DL .
INFORMATION PROCESSING LETTERS, 2006, 97 (02) :64-67