Research on Buffer Dynamic Capacity-Increase Scheduling Method in Flexible Flow Shop Based on Public Buffer

In the light of the dynamic capacity-increase problem of the limited buffer in flexible flow shops, this paper proposes a buffer dynamic capacity-increase scheduling method based on the public buffer, establishing a mathematical programming model of flexible flow shops with the limited buffer. According to the time cost of workpiece transferred into and out of the public buffer, we design the scheduling rules to control workpiece's access to and from the public buffer. Through the buffer dynamic capacity-increase scheduling method based on local scheduling rules as the core, the production blockage caused by capacity limitation of limited buffer in flexible flow shops is solved. Through the instance data test, a simulation experiment is designed to compare the scheduling result of the dynamic capacity-increase scheduling method in flexible flow shops with that of scheduling method without applying the proposed method. It is verified that this scheduling method is effective for solving such scheduling problems in actual workshop production.

[1]  Nabil Nahas,et al.  Buffer allocation and preventive maintenance optimization in unreliable production lines , 2017, J. Intell. Manuf..

[2]  Zhonghua Han,et al.  Multiple rules with game theoretic analysis for flexible flow shop scheduling problem with component altering times , 2016, Int. J. Model. Identif. Control..

[3]  Fulya Altiparmak,et al.  Simulation of manufacturing operations: optimization of buffer sizes in assembly systems using intelligent techniques , 2002, WSC '02.

[4]  Zhao Xiao Optimal buffer allocation in reconfigurable FMSs , 2000 .

[5]  Gur Mosheiov,et al.  Batch Scheduling In A Two-Stage Flexible Flow Shop Problem , 2014 .

[6]  Hans Röck,et al.  The Three-Machine No-Wait Flow Shop is NP-Complete , 1984, JACM.

[7]  Jatinder N. D. Gupta,et al.  Two-Stage, Hybrid Flowshop Scheduling Problem , 1988 .

[8]  Yannick Frein,et al.  Production planning in automotive powertrain plants: a case study , 2017, Int. J. Prod. Res..

[9]  Xinyu Li,et al.  Solving flexible job shop scheduling using an effective memetic algorithm , 2016, Int. J. Comput. Appl. Technol..

[10]  Gupta J.N.D. TWO-STAGE HYBRID FLOW SHOP SCHEDULING PROBLEM , 1988 .

[11]  Anton V. Eremeev,et al.  Analysis of a multicriterial buffer capacity optimization problem for a production line , 2017, Autom. Remote. Control..

[12]  Takayuki Kobayashi,et al.  A Study on Lot-Size Dependence of Energy Consumption per Unit of Production Throughput Considering Buffer Capacity , 2017, Int. J. Autom. Technol..

[13]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[14]  Fariborz Jolai,et al.  Integrating sequence-dependent group scheduling problem and preventive maintenance in flexible flow shops , 2015 .

[15]  Nils Boysen,et al.  A decomposition approach for the car resequencing problem with selectivity banks , 2013, Comput. Oper. Res..