Hybrid heuristics for planning job rotation schedules in assembly lines with heterogeneous workers

We investigate the problem of balancing assembly lines with heterogeneous workers while considering job rotation schedules. This problem typically occurs in assembly lines in sheltered work centers for disabled. We propose a hybrid algorithm that uses a Mixed Integer Programming (MIP) to select appropriate schedules from a pool of heuristically constructed solutions. A local search based on MIP neighborhoods is used as a post-optimization method. Our results show that this approach is fast, flexible and accurate when compared with current available methods.

[1]  Armin Scholl,et al.  State-of-the-art exact and heuristic solution procedures for simple assembly line balancing , 2006, Eur. J. Oper. Res..

[2]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[3]  L. A. Lorena,et al.  Clustering Search Approach for the Assembly Line Worker Assignment and Balancing Problem , 2007 .

[4]  Luiz Antonio Nogueira Lorena,et al.  Hybrid Metaheuristic for the Assembly Line Worker Assignment and Balancing Problem , 2009, Hybrid Metaheuristics.

[5]  Armin Scholl,et al.  Balancing and Sequencing of Assembly Lines , 1995 .

[6]  H. J. Coury,et al.  Evaluation of musculoskeletal health outcomes in the context of job rotation and multifunctional jobs. , 2009, Applied ergonomics.

[7]  M S Redfern,et al.  Designing safe job rotation schedules using optimization and heuristic search , 2000, Ergonomics.

[8]  Günther R. Raidl,et al.  Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification , 2005, IWINAC.

[9]  Fred McLanahan Tonge,et al.  A heuristic program for assembly line balancing , 1961 .

[10]  B. Micieta,et al.  Assembly Line Balancing , 2011 .

[11]  Nils Boysen,et al.  Assembly line balancing: Which model to use when? , 2006 .

[12]  Soumen Ghosh,et al.  A comprehensive literature review and analysis of the design, balancing and scheduling of assembly systems , 1989 .

[13]  Serap Ulusam Seçkiner,et al.  A simulated annealing approach to the solution of job rotation scheduling problems , 2007, Appl. Math. Comput..

[14]  Carlos Andrés,et al.  Advantages of assembly lines in Sheltered Work Centres for Disabled. A case study , 2007 .

[15]  Christian Blum,et al.  On solving the assembly line worker assignment and balancing problem via beam search , 2011, Comput. Oper. Res..

[16]  Yves Rochat,et al.  Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.

[17]  M. Kamel,et al.  A Taxonomy of Cooperative Search Algorithms , 2005, Hybrid Metaheuristics.

[18]  Olga Guschinskaya,et al.  Matheuristics - Hybridizing Metaheuristics and Mathematical Programming , 2010, Matheuristics.

[19]  Ilker Baybars,et al.  A survey of exact algorithms for the simple assembly line balancing , 1986 .

[20]  Nils Boysen,et al.  Absalom: Balancing assembly lines with assignment restrictions , 2010, Eur. J. Oper. Res..

[21]  Michel Gendreau,et al.  Handbook of Metaheuristics , 2010 .

[22]  Armin Scholl,et al.  Simple assembly line balancing—Heuristic approaches , 1997, J. Heuristics.

[23]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[24]  Alysson M. Costa,et al.  Simple heuristics for the assembly line worker assignment and balancing problem , 2010, Journal of Heuristics.

[25]  Nils Boysen,et al.  Resequencing of mixed-model assembly lines: Survey and research agenda , 2012, Eur. J. Oper. Res..

[26]  Serap Ulusam Seçkiner,et al.  Ant colony optimization for the job rotation scheduling problem , 2008, Appl. Math. Comput..

[27]  Christian Blum,et al.  Hybrid metaheuristics in combinatorial optimization: A survey , 2011, Appl. Soft Comput..

[28]  Bryan A. Norman,et al.  A methodology to create robust job rotation schedules , 2007, Ann. Oper. Res..

[29]  Nils Boysen,et al.  A classification of assembly line balancing problems , 2007, Eur. J. Oper. Res..

[30]  M. B. Aryanezhad,et al.  Designing safe job rotation schedules based upon workers’ skills , 2009 .

[31]  Ming Liang,et al.  Modeling Job Rotation in Manufacturing Systems: The Study of Employee's Boredom and Skill Variations , 2010 .

[32]  Carlos Andrés,et al.  Branch and bound procedures for solving the Assembly Line Worker Assignment and Balancing Problem: Application to Sheltered Work centres for Disabled , 2008, Discret. Appl. Math..

[33]  Armin Scholl,et al.  SALBPGen - A systematic data generator for (simple) assembly line balancing , 2011 .

[34]  Nuchsara Kriengkorakot,et al.  The Assembly Line Balancing Problem : Review articles * , 2012 .

[35]  Alysson M. Costa,et al.  A minimalist yet efficient tabu search algorithm for balancing assembly lines with disabled workers , 2009 .

[36]  Alysson M. Costa,et al.  Job rotation in assembly lines employing disabled workers , 2009 .

[37]  Nils Boysen,et al.  A versatile algorithm for assembly line balancing , 2008, Eur. J. Oper. Res..