Hybrid genetic algorithm and tabu search for finite capacity material requirement planning system in flexible flow shop with assembly operations

We propose a hybrid genetic algorithm (GA) and tabu search (TS) called HGATS for the FCMRP system.We evaluate the performance of HGATS in flexible flow shop with assembly operations based on industrial scale problems.HGATS outperforms GA, TS and the existing FCMRP algorithm done in 2014.HGATS improves the total cost obtained from the existing algorithm about 31.34% on average.HGATS requires a practical computational time when applied to real industrial cases. The finite capacity material requirement planning system (FCMRP) for industrial scale flexible flow shops is known to be strongly NP-hard. Due to very long computational time, the exact method can be inappropriate for this problem. In this paper, a new hybrid improvement algorithm for the FCMRP system in a flexible flow shop with assembly operations is proposed. The proposed algorithm is a hybrid of genetic algorithm (GA) and tabu search (TS) called HGATS. There are six primary steps in HGATS. In step 1, a production schedule is generated by variable lead-time MRP (VMRP). In step 2, dispatching and random rules are applied to generate initial sequences of orders. From step 3 to step 5, the sequences of orders are iteratively improved by characteristics of TS and GA. Finally, the start times of operations are optimally determined by linear programming. The results show that HGATS outperforms GA, TS and the existing algorithm. Furthermore, HGATS requires a practical computational time when applied to real industrial cases.

[1]  Herbert Jodlbauer,et al.  Material and capacity requirements planning with dynamic lead times , 2012 .

[2]  Xiao Xu,et al.  An asynchronous genetic local search algorithm for the permutation flowshop scheduling problem with total flowtime minimization , 2011, Expert Syst. Appl..

[3]  J. Grabowski,et al.  The permutation flow shop problem with blocking. A tabu search approach , 2007 .

[4]  Mitsuo Gen,et al.  Hybrid sampling strategy-based multiobjective evolutionary algorithm for process planning and scheduling problem , 2014, J. Intell. Manuf..

[5]  Mohamed Haouari,et al.  Improved bounds for hybrid flow shop scheduling with multiprocessor tasks , 2013, Comput. Ind. Eng..

[6]  Lars Mönch,et al.  Scheduling jobs with ready times and precedence constraints on parallel batch machines using metaheuristics , 2014, Comput. Ind. Eng..

[7]  Silvana Trimi,et al.  A comparative study of proprietary ERP and open source ERP modules on the value chain , 2011, Int. J. Inf. Decis. Sci..

[8]  Massimo Paolucci,et al.  Production planning of mixed-model assembly lines: a heuristic mixed integer programming based approach , 2013 .

[9]  Ming Liu,et al.  A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem , 2013, Comput. Oper. Res..

[10]  Antonio Costa,et al.  A dual encoding-based meta-heuristic algorithm for solving a constrained hybrid flow shop scheduling problem , 2013, Comput. Ind. Eng..

[11]  Cengiz Kahraman,et al.  An Application Of Effective Genetic Algorithms For Solving Hybrid Flow Shop Scheduling Problems , 2008, Int. J. Comput. Intell. Syst..

[12]  S. H. Choi,et al.  A hybrid estimation of distribution algorithm for simulation-based scheduling in a stochastic permutation flowshop , 2015, Comput. Ind. Eng..

[13]  Rym M'Hallah,et al.  Minimizing total earliness and tardiness on a permutation flow shop using VNS and MIP , 2014, Comput. Ind. Eng..

[14]  N. Jawahar,et al.  A heuristic algorithm for joint optimisation of MRP and scheduling in a mixed model assembly line , 2009, Int. J. Adv. Oper. Manag..

[15]  Ching-Jong Liao,et al.  An efficient heuristic for a two-stage assembly scheduling problem with batch setup times to minimize makespan , 2015, Comput. Ind. Eng..

[16]  A. Costa,et al.  Hybrid genetic optimization for solving the batch-scheduling problem in a pharmaceutical industry , 2015, Comput. Ind. Eng..

[17]  Katsuhiko Takahashi,et al.  A New Heuristic Method for Capacitated Lot-sizing in Multi-stage, Multi-machine Production Systems , 2005 .

[18]  Jinwoo Park,et al.  Integrated model for production planning and scheduling in a supply chain using benchmarked genetic algorithm , 2008 .

[19]  Dipak Laha,et al.  An improved heuristic to minimize total flow time for scheduling in the m-machine no-wait flow shop , 2014, Comput. Ind. Eng..

[20]  Pisal Yenradee,et al.  Performance of TOC based finite capacity material requirement planning system for a multi-stage assembly factory , 2007 .

[21]  R. Sridharan,et al.  Development and analysis of hybrid genetic algorithms for flow shop scheduling with sequence dependent setup time , 2014 .

[22]  Tommaso Rossi,et al.  A simulation-based finite capacity MRP procedure not depending on lead time estimation , 2011 .

[23]  Mitsuo Gen,et al.  Adaptive genetic algorithm for advanced planning in manufacturing supply chain , 2006, J. Intell. Manuf..

[24]  Mitsuo Gen,et al.  A Multiobjective Hybrid Genetic Algorithm for TFT-LCD Module Assembly Scheduling , 2014, IEEE Transactions on Automation Science and Engineering.

[25]  Yueh-Min Huang,et al.  Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm , 2008, Expert Syst. Appl..

[26]  Marcelo Seido Nagano,et al.  A Constructive Genetic Algorithm for Permutation Flowshop Scheduling Version 2 , 2007 .

[27]  Mitsuo Gen,et al.  Effective genetic approach for optimizing advanced planning and scheduling in flexible manufacturing system , 2006, GECCO.

[28]  Mitsuo Gen,et al.  A new model for single machine scheduling with uncertain processing time , 2017, J. Intell. Manuf..

[29]  Frank Werner,et al.  A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria , 2009, Comput. Oper. Res..

[30]  Weiming Shen,et al.  An overview of distributed process planning and its integration with scheduling , 2006, Int. J. Comput. Appl. Technol..

[31]  Cemalettin Öztürk,et al.  Capacitated lot sizing with linked lots for general product structures in job shops , 2010, Computers & industrial engineering.

[32]  Wen-Hsien Tsai,et al.  Successful global ERP rollout: a case study , 2011 .

[33]  S. H. Choi,et al.  Flexible flow shop scheduling with stochastic processing times: A decomposition-based approach , 2012, Comput. Ind. Eng..

[34]  Arslan M. Ornek,et al.  Capacitated lot sizing with alternative routings and overtime decisions , 2006 .

[35]  Ping Chen,et al.  Self-adaptive perturbation and multi-neighborhood search for iterated local search on the permutation flow shop problem , 2015, Comput. Ind. Eng..

[36]  Pisal Yenradee,et al.  Finite capacity material requirement planning system for assembly flow shop with alternative work centres , 2014 .

[37]  Cemalettin Öztürk,et al.  A MIP based heuristic for capacitated MRP systems , 2012, Computers & industrial engineering.

[38]  Muh-Cherng Wu,et al.  Effect of solution representations on Tabu search in scheduling applications , 2013, Comput. Oper. Res..

[39]  John J. Kanet,et al.  Integrating production planning and control: towards a simple model for Capacitated ERP , 2010 .

[40]  Bernardo Almada-Lobo,et al.  Lot sizing and scheduling: industrial extensions and research opportunities , 2011 .

[41]  Katsuhiko Takahashi,et al.  MRP rescheduling heuristics with capacity extension under deterministic demand , 2006, Comput. Ind. Eng..

[42]  Ruhul A. Sarker,et al.  A genetic algorithm for permutation flow shop scheduling under make to stock production system , 2015, Comput. Ind. Eng..