Dynamic adjustment of dispatching rule parameters in flow shops with sequence-dependent set-up times

被引:51
作者
Heger, Jens [1 ]
Branke, Jurgen [2 ]
Hildebrandt, Torsten [3 ]
Scholz-Reiter, Bernd [3 ]
机构
[1] Univ Luneburg, Inst Prod & Proc Innovat PPI, Luneburg, Germany
[2] Univ Warwick, Warwick Business Sch, Coventry, W Midlands, England
[3] Univ Bremen, BIBA Bremer Inst Prod & Logist GmbH, Bremen, Germany
关键词
scheduling; simulation; production; artificial intelligence; flexible manufacturing systems; Gaussian processes; TOTAL WEIGHTED TARDINESS; JOB-SHOP; SCHEDULING JOBS; PARALLEL MACHINES; NEURAL-NETWORK; SELECTION; FAMILIES; MINIMIZE;
D O I
10.1080/00207543.2016.1178406
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Decentralised scheduling with dispatching rules is applied in many fields of production and logistics, especially in highly complex manufacturing systems. Since dispatching rules are restricted to their local information horizon, there is no rule that outperforms other rules across various objectives, scenarios and system conditions. In this paper, we present an approach to dynamically adjust the parameters of a dispatching rule depending on the current system conditions. The influence of different parameter settings of the chosen rule on the system performance is estimated by a machine learning method, whose learning data is generated by preliminary simulation runs. Using a dynamic flow shop scenario with sequence-dependent set-up times, we demonstrate that our approach is capable of significantly reducing the mean tardiness of jobs.
引用
收藏
页码:6812 / 6824
页数:13
相关论文
共 35 条
[11]  
HAUPT R, 1989, OR SPEKTRUM, V11, P3
[12]  
Heger J., 2013, CENTRAL EUROPEAN J O, V23, P235
[13]  
Heger J., 2013, ROBUST MANUFACTURING, V1, P73
[14]   Scheduling jobs on parallel machines with sequence-dependent setup times [J].
Lee, YH ;
Pinedo, M .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 100 (03) :464-474
[15]   A heuristic to minimize the total weighted tardiness with sequence-dependent setups [J].
Lee, YH ;
Bhaskaran, K ;
Pinedo, M .
IIE TRANSACTIONS, 1997, 29 (01) :45-52
[16]   A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops [J].
Mason, SJ ;
Fowler, JW ;
Carlyle, WM .
JOURNAL OF SCHEDULING, 2002, 5 (03) :247-262
[17]   A COMPARISON OF THREE METHODS FOR SELECTING VALUES OF INPUT VARIABLES IN THE ANALYSIS OF OUTPUT FROM A COMPUTER CODE [J].
MCKAY, MD ;
BECKMAN, RJ ;
CONOVER, WJ .
TECHNOMETRICS, 1979, 21 (02) :239-245
[18]   Real time selection of scheduling rules and knowledge extraction via dynamically controlled data mining [J].
Metan, Gokhan ;
Sabuncuoglu, Ihsan ;
Pierreval, Henri .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2010, 48 (23) :6909-6938
[19]   Simulation-based benchmarking of production control schemes for complex manufacturing systems [J].
Moench, Lars .
CONTROL ENGINEERING PRACTICE, 2007, 15 (11) :1381-1393
[20]   Machine learning techniques for scheduling jobs with incompatible families and unequal ready times on parallel batch machines [J].
Monch, L ;
Zimmermann, J ;
Otto, P .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2006, 19 (03) :235-245