A simulated annealing algorithm for the job shop cell scheduling problem with intercellular moves and reentrant parts

This paper addresses the problem of scheduling parts in job shop cellular manufacturing systems by considering exceptional parts that need to visit machines in different cells and reentrant parts which need to visit some machines more than once in non-consecutive manner. Initially, an integer linear programming (ILP) model is presented for the problem to minimize the makespan, which considers intercellular moves and non-consecutive multiple processing of parts on a machine. Due to the complexity of the model, a simulated annealing (SA) based solution approach is developed to solve the problem. To increase the efficiency of the search algorithm, a neighborhood structure based on the concept of blocks is applied. Subsequently, the efficiency of the ILP model and the performance of the proposed SA are assessed over a set of problem instances taken from the literature. The proposed ILP model was coded in Lingo 8.0 and the solution obtained by the proposed SA was compared to the optimal values. The computational results demonstrate that the proposed ILP model and SA algorithm are effective and efficient for this problem.

[1]  Mostafa Zandieh,et al.  An adaptive multi-population genetic algorithm to solve the multi-objective group scheduling problem in hybrid flexible flowshop with sequence-dependent setup times , 2011, J. Intell. Manuf..

[2]  Katsundo Hitomi,et al.  Optimal Two-Stage Production Scheduling with Setup Times Separated , 1979 .

[3]  Reza Tavakkoli-Moghaddam,et al.  Design of a scatter search method for a novel multi-criteria group scheduling problem in a cellular manufacturing system , 2010, Expert Syst. Appl..

[4]  Shih-Wei Lin,et al.  Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times , 2009, Comput. Oper. Res..

[5]  Ikou Kaku,et al.  Optimization of parts scheduling in multiple cells considering intercell move using scatter search approach , 2010, J. Intell. Manuf..

[6]  S. M. Shafer,et al.  A simulation analyses of factors influencing loading practices in cellular manufacturing , 1995 .

[7]  R. Radharamanan.  A heuristic algorithm for group scheduling , 1986 .

[8]  Mostafa Zandieh,et al.  Robust metaheuristics for group scheduling with sequence-dependent setup times in hybrid flexible flow shops , 2009 .

[9]  C. Leggett.  A case study of a batch manufacturing plant simulation , 1978 .

[10]  Rasaratnam Logendran,et al.  Total flow time minimization in a flowshop sequence-dependent group scheduling problem , 2010, Comput. Oper. Res..

[11]  Y. Won,et al.  Multiple criteria clustering algorithm for solving the group technology problem with multiple process routings , 1997 .

[12]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation , 1996 .

[13]  H Hendizadeh,et al.  META- HEURISTICS FOR SCHEDULING A FLOW SHOP MANUFACTURING CELL WITH SEQUENCE DEPENDENT FAMILY SETUP TIMES , 2008 .

[14]  Nancy Lea Hyer,et al.  Cellular manufacturing in the U.S. industry: a survey of users , 1989 .

[15]  Jatinder N. D. Gupta,et al.  Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups , 2010 .

[16]  Jeffrey E. Schaller.  A new lower bound for the flow shop group scheduling problem , 2001 .

[17]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

[18]  Gürsel A. Süer,et al.  Evaluation of manufacturing cell loading rules for independent cells , 1999 .

[19]  Ching-Jong Liao,et al.  Group scheduling on two cells with intercell movement , 1996, Comput. Oper. Res..

[20]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[21]  Stella Sofianopoulou,et al.  Manufacturing cells design with alternative process plans and/or replicate machines , 1999 .

[22]  S. Venkataramanaiah,et al.  Scheduling in cellular manufacturing systems: an heuristic approach , 2008 .

[23]  Rasaratnam Logendran,et al.  Combined heuristics for bi-level group scheduling problems , 1995 .

[24]  Jamal Arkat,et al.  Applying simulated annealing to cellular manufacturing system design , 2007 .

[25]  Maw-Sheng Chern,et al.  Two-machine flowshop group scheduling problem , 2000, Computers & Operations Research.

[26]  Peigen Li,et al.  A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem , 2007, Comput. Oper. Res..

[27]  D. Ben-Arieh,et al.  Group scheduling using group technology concepts , 1989 .

[28]  P. Vrat,et al.  Some design issues in cellular manufacturing using the fuzzy programming approach , 1999 .

[29]  Festus O. Olorunniwo,et al.  The impact of management and employees on cellular manufacturing implementation , 2002 .

[30]  Maghsud Solimanpur,et al.  A heuristic to minimize makespan of cell scheduling problem , 2004 .

[31]  Adil Baykasoglu,et al.  A new integrated system for loading and scheduling in cellular manufacturing , 2002, Int. J. Comput. Integr. Manuf..

[32]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[33]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[34]  Rakesh Nagi,et al.  An efficient heuristic in manufacturing cell formation for group technology applications , 1990 .

[35]  Mostafa Zandieh,et al.  Bi-objective group scheduling in hybrid flexible flowshop: A multi-phase approach , 2010, Expert Syst. Appl..

[36]  Rasaratnam Logendran,et al.  Minimizing the makespan of a group scheduling problem: a new heuristic , 1991 .

[37]  K. R Baker,et al.  Scheduling groups of jobs in the two-machine flow shop , 1990 .

[38]  Rasaratnam Logendran,et al.  Sequence-dependent group scheduling problems in flexible flow shops , 2006 .

[39]  Rasaratnam Logendran,et al.  Group scheduling in flexible flow shops , 2005 .