A comparison of hybrid genetic algorithm and hybrid particle swarm optimization to minimize makespan for assembly job shop

Very often, studies of job shop scheduling problem (JSSP) ignore assembly relationship and lot splitting. If an assembly stage is appended to JSSP for the final product, the problem then becomes assembly job shop scheduling problem (AJSSP). To allow lot splitting, lot streaming (LS) technique is examined in which jobs may be split into a number of smaller sub-jobs for parallel processing on different stages such that the system performance may be improved. In this study, the system objective is defined as the makespan minimization. In order to investigate the impact of LS on the system objective under different real-life operating conditions, part sharing ratio (PSR) and system congestion index (SCI) are considered. PSR is used to differentiate product-specific components from general-purpose, common components, and SCI for creating different starting conditions of the shop floor. Both PSR and CSI are useful as part sharing (also known as component commonality) is a common practice for manufacturing with assembly operations and system loading is a significant factor in influencing the shop floor performance. Since the complexity of AJSSP is NP-hard, a hybrid genetic algorithm (HGA) and a hybrid particle swarm optimization (HPSO) are proposed and developed to solve AJSSP in consideration of LS technique. Computational results show that for all test problems under various system conditions, HGA can significantly outperform HPSO. Also, equal-sized lot splitting is found to be the most beneficial LS strategy especially for medium-to-large problem size.

[1]  Chengbin Chu,et al.  New exact method to solve the Pm/rj/∑Cj schedule problem , 2006 .

[2]  Yeong-Dae Kim,et al.  Simulated annealing and genetic algorithms for scheduling products with multi-level product structure , 1996, Comput. Oper. Res..

[3]  Mehmet Fatih Tasgetiren,et al.  A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem , 2007, Eur. J. Oper. Res..

[4]  Felix T. S. Chan,et al.  A resource-constrained assembly job shop scheduling problem with Lot Streaming technique , 2009, Comput. Ind. Eng..

[5]  Fawaz S. Al-Anzi,et al.  A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application , 2006, Comput. Oper. Res..

[6]  G. Moslehi,et al.  A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search , 2011 .

[7]  Haibin Yu,et al.  Neural network and genetic algorithm-based hybrid approach to expanded job-shop scheduling , 2001 .

[8]  Mark S. Hillier.  The costs and benefits of commonality in assemble-to-order systems with a (Q, r)-policy for component replenishment , 2002, Eur. J. Oper. Res..

[9]  Chandrasekharan Rajendran,et al.  Scheduling rules for dynamic shops that manufacture multi-level jobs , 2003 .

[10]  D. Y. Sha,et al.  A new particle swarm optimization for the open shop scheduling problem , 2008, Comput. Oper. Res..

[11]  Isao Ono,et al.  A genetic algorithm for job-shop scheduling problems using job-based order crossover , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[12]  Felix T. S. Chan,et al.  An evolutionary algorithm for assembly job shop with part sharing , 2009, Comput. Ind. Eng..

[13]  Pupong Pongcharoen,et al.  The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure , 2004, Eur. J. Oper. Res..

[14]  Rajesh Srivastava,et al.  Priority scheduling policies for repair shops , 2000 .

[15]  Wade H. Shaw,et al.  Simulation modeling of a dynamic job shop rescheduling with machine availability constraints , 1998 .

[16]  Seyyed M. T. Fatemi Ghomi,et al.  A high performing metaheuristic for job shop scheduling with sequence-dependent setup times , 2010, Appl. Soft Comput..

[17]  Chih-Ming Hsu,et al.  Benefits of lot splitting in job-shop scheduling , 2004 .

[18]  Y.-D. Kim *,et al.  Parallel machine scheduling considering a job-splitting property , 2004 .

[19]  D. H. Cummings,et al.  Minimizing production flow time in a process and assembly job shop , 1998 .

[20]  Ching-Jong Liao,et al.  A discrete particle swarm optimization for lot-streaming flowshop scheduling problem , 2008, Eur. J. Oper. Res..

[21]  Peng-Yeng Yin,et al.  A particle swarm optimization approach to the nonlinear resource allocation problem , 2006, Appl. Math. Comput..

[22]  An interactive tool for designing manufacturing cells for an assembly job-shop , 2000 .

[23]  Felix T.S. Chan,et al.  Lot streaming for product assembly in job shop environment , 2008 .

[24]  Jean-Charles Billaut,et al.  A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem , 2008, Eur. J. Oper. Res..

[25]  Pupong Pongcharoen,et al.  Determining optimum Genetic Algorithm parameters for scheduling the manufacturing and assembly of complex products , 2002 .

[26]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[27]  Gürsel A. Süer,et al.  Identical machine scheduling to minimize the number of tardy jobs when lot-splitting is allowed , 1997 .

[28]  Kenneth R. Baker,et al.  Basic Techniques for Lot Streaming , 1993, Oper. Res..

[29]  P. Pongcharoena,et al.  Determining optimum Genetic Algorithm parameters for scheduling the manufacturing and assembly of complex products , 2002 .

[30]  Pius J. Egbelu,et al.  An algorithm for minimizing weighted earliness penalty in assembly job shops , 2006 .

[31]  Lionel Amodeo,et al.  A linear programming approach for identical parallel machine scheduling with job splitting and sequence-dependent setup times , 2006 .

[32]  Chandrasekharan Rajendran,et al.  Scheduling in dynamic assembly job-shops with jobs having different holding and tardiness costs , 2003 .

[33]  D. Y. Sha,et al.  A hybrid particle swarm optimization for job shop scheduling problem , 2006, Comput. Ind. Eng..

[34]  Hung T. Nguyen,et al.  Hybrid Fuzzy Logic-Based Particle Swarm Optimization for Flow shop Scheduling Problem , 2011, Int. J. Comput. Intell. Appl..

[35]  Dion H. Cummings Mckoy.  Production scheduling in a process and assembly job shop , 1999 .

[36]  Zhiming Wu,et al.  An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems , 2005, Comput. Ind. Eng..

[37]  Wai Keung Wong,et al.  Mathematical model and genetic optimization for the job shop scheduling problem in a mixed- and multi-product assembly environment: A case study based on the apparel industry , 2006, Comput. Ind. Eng..

[38]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[39]  S. Reiter.  A System for Managing Job-Shop Production , 1966 .

[40]  Pin Luarn,et al.  A discrete version of particle swarm optimization for flowshop scheduling problems , 2007, Comput. Oper. Res..

[41]  Fawaz S. Al-Anzi,et al.  Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times , 2006 .

[42]  Rong-Hwa Huang,et al.  Multi-objective job-shop scheduling with lot-splitting production , 2010 .

[43]  Huan Neng Chiu,et al.  A comprehensive review of lot streaming , 2005 .