Multi-task processing oriented production layout based on evolutionary programming mechanism

Abstract Traditional job scheduling is an independent optimization phase without considering material flow among machines. However, in actual production, the machine layout will affect material flow time, and therefore affecting job completion time. In this paper, a novel multi-task-oriented production layout problem is proposed, with the goal to optimize material flow by adjusting machine placement. To solve this problem, a production layout evolution (PLEV) framework is established, which models it as a two-stage optimization problem. In the first stage, a concept of ‘relevance between machines (RBM)’ is proposed The RBM measures the relationship between two machines according to the processing data. And a machine placement scheme is designed based on RBM. In the second stage, a job scheduling rule based on the earliest finish time (EFT) is adopted to evaluate production layouts. Then, through an evolutionary programming mechanism, the production layout can evolve to optimize makespan. Experiments are carried out to verify the feasibility and performance of the proposed PLEV framework. The results demonstrate that promising product layouts for multi-task processing can be obtained by using this framework.

[1]  Voratas Kachitvichyanukul,et al.  A two-level particle swarm optimisation algorithm for open-shop scheduling problem , 2016, Int. J. Comput. Sci. Math..

[2]  Mostafa Zandieh,et al.  A contribution and new heuristics for open shop scheduling , 2010, Comput. Oper. Res..

[3]  Ling Wang,et al.  A Two-Phase Meta-Heuristic for Multiobjective Flexible Job Shop Scheduling Problem With Total Energy Consumption Threshold , 2019, IEEE Transactions on Cybernetics.

[4]  Ling Wang,et al.  A modified evolutionary programming for flow shop scheduling , 2003 .

[5]  Gonzalo Mejía,et al.  A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times , 2020, Eur. J. Oper. Res..

[6]  Joseph Y.-T. Leung Open Shop Scheduling , 2004 .

[7]  Henri Pierreval,et al.  Facility layout problems: A survey , 2007, Annu. Rev. Control..

[8]  Qiang Zhang,et al.  Flexible open shop scheduling problem to minimize makespan , 2016, Comput. Oper. Res..

[9]  Yueh-Min Huang,et al.  A new bee colony optimization algorithm with idle-time-based filtering scheme for open shop-scheduling problems , 2011, Expert Syst. Appl..

[10]  Reza Tavakkoli-Moghaddam,et al.  A multi-objective particle swarm optimisation algorithm for unequal sized dynamic facility layout problem with pickup/drop-off locations , 2012 .

[11]  Hamidreza Navidi,et al.  Dynamic Facility Layout Problem: A New Bilevel Formulation and Some Metaheuristic Solution Methods , 2015, IEEE Transactions on Engineering Management.

[12]  Rommel G. Regis,et al.  Evolutionary Programming for High-Dimensional Constrained Expensive Black-Box Optimization Using Radial Basis Functions , 2014, IEEE Transactions on Evolutionary Computation.

[13]  Marco A. Contreras-Cruz,et al.  Mobile robot path planning using artificial bee colony and evolutionary programming , 2015, Appl. Soft Comput..

[14]  Oliver Rose,et al.  The shortest processing time first (SPTF) dispatch rule and some variants in semiconductor manufacturing , 2001, Proceeding of the 2001 Winter Simulation Conference (Cat. No.01CH37304).

[15]  Quan-Ke Pan,et al.  An Effective Artificial Bee Colony Algorithm for a Real-World Hybrid Flowshop Problem in Steelmaking Process , 2013, IEEE Transactions on Automation Science and Engineering.

[16]  Mark Johnston,et al.  Automatic Design of Scheduling Policies for Dynamic Multi-objective Job Shop Scheduling via Cooperative Coevolution Genetic Programming , 2014, IEEE Transactions on Evolutionary Computation.

[17]  Yaochu Jin,et al.  Evolutionary Multiobjective Blocking Lot-Streaming Flow Shop Scheduling With Machine Breakdowns , 2019, IEEE Transactions on Cybernetics.

[18]  Raed Abdulkareem Hasan,et al.  Particle swarm optimization for facility layout problems FLP — A comprehensive study , 2017, 2017 13th IEEE International Conference on Intelligent Computer Communication and Processing (ICCP).

[19]  MengChu Zhou,et al.  Optimizing Hospital Emergency Department Layout via Multiobjective Tabu Search , 2019, IEEE Transactions on Automation Science and Engineering.

[20]  Hamidreza Koosha,et al.  Solving an extended multi-row facility layout problem with fuzzy clearances using GA , 2017, Appl. Soft Comput..

[21]  Xin Yao,et al.  Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..

[22]  Mohamed Elhoseny,et al.  Extended Genetic Algorithm for solving open-shop scheduling problem , 2019, Soft Comput..

[23]  MengChu Zhou,et al.  Flexible Job-Shop Rescheduling for New Job Insertion by Using Discrete Jaya Algorithm , 2019, IEEE Transactions on Cybernetics.

[24]  Hasan Hosseini-Nasab,et al.  A hybrid particle swarm optimisation for dynamic facility layout problem , 2013 .

[25]  Rubén Ruiz,et al.  An Iterated Greedy Heuristic for Mixed No-Wait Flowshop Problems , 2018, IEEE Transactions on Cybernetics.

[26]  Iraj Mahdavi,et al.  A bi-objective possibilistic programming model for open shop scheduling problems with sequence-dependent setup times, fuzzy processing times, and fuzzy due dates , 2012, Appl. Soft Comput..

[27]  Fardin Ahmadizar,et al.  A novel hybrid genetic algorithm for the open shop scheduling problem , 2012 .

[28]  Türkay Dereli,et al.  An ant colony algorithm for solving budget constrained and unconstrained dynamic facility layout problems , 2006 .

[29]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[30]  Dheeraj K. Khatod,et al.  Evolutionary programming based optimal placement of renewable distributed generators , 2013, IEEE Transactions on Power Systems.

[31]  Mark Johnston,et al.  Automatic Programming via Iterated Local Search for Dynamic Job Shop Scheduling , 2015, IEEE Transactions on Cybernetics.

[32]  Roberto Tempo,et al.  Distributed Randomized Algorithms for the PageRank Computation , 2010, IEEE Transactions on Automatic Control.

[33]  Lixin Tang,et al.  Open shop scheduling problem to minimize makespan with release dates , 2013 .

[34]  Ali Taghavi,et al.  A heuristic procedure for the integrated facility layout design and flow assignment problem , 2011, Comput. Ind. Eng..

[35]  Ramazan Sahin A simulated annealing algorithm for solving the bi-objective facility layout problem , 2011, Expert Syst. Appl..

[36]  Hua Xu,et al.  Multiobjective Flexible Job Shop Scheduling Using Memetic Algorithms , 2015, IEEE Transactions on Automation Science and Engineering.

[37]  Reza Tavakkoli-Moghaddam,et al.  Solving a multi-objective open shop scheduling problem by a novel hybrid ant colony optimization , 2011, Expert Syst. Appl..

[38]  Miguel F. Anjos,et al.  Mathematical optimization approaches for facility layout problems: The state-of-the-art and future research directions , 2017, Eur. J. Oper. Res..

[39]  Alice E. Smith,et al.  Solving an Extended Double Row Layout Problem Using Multiobjective Tabu Search and Linear Programming , 2014, IEEE Transactions on Automation Science and Engineering.

[40]  Ali Azadeh,et al.  Multi-objective open shop scheduling by considering human error and preventive maintenance , 2019, Applied Mathematical Modelling.

[41]  Amir Sadrzadeh,et al.  A genetic algorithm with the heuristic procedure to solve the multi-line layout problem , 2012, Comput. Ind. Eng..

[42]  MengChu Zhou,et al.  A Three-Stage Approach to a Multirow Parallel Machine Layout Problem , 2019, IEEE Transactions on Automation Science and Engineering.

[43]  Hermann Lödding,et al.  The surprising effectiveness of earliest operation due-date sequencing , 2017 .