Scheduling of no buffer job shop cells with blocking constraints and automated guided vehicles

This paper addresses an extension of Block Job shop Scheduling problem taking AGV.Two integer non-linear programming (INLP) models are proposed.A two-stage heuristic combining improved timetabling and local search is developed.Four principles are proposed to guarantee the feasibility of the search.A set of benchmark tests is conducted to testify the effectiveness of the method. The blocking job shop (BJS) problem is an extension of a job shop problem with no buffer constraints. It means that after a job is completed on the current machine, it remains on that machine until the next machine becomes available. This paper addresses an extension of the BJS problem, which takes into account transferring jobs between different machines using a limited number of automated guided vehicles (AGV), called a BJS-AGV problem. Two integer non-linear programming (INLP) models are proposed. A two-stage heuristic algorithm that combines an improving timetabling method and a local search is proposed to solve the BJS-AGV problem. A neighborhood structure in the local search is proposed based on a disjunctive graph model. According to the characteristics of the BJS-AGV problem, four principles are proposed to guarantee the feasibility of the search neighborhood. Computation results are presented for a set of benchmarking tests, some of which are enlarged by transportation times between different machines. The numerical results show the effectiveness of the proposed two-stage algorithm.

[1]  Ponnuthurai N. Suganthan,et al.  A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems , 2010, Comput. Oper. Res..

[2]  Marie-Ange Manier,et al.  A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times , 2012, Comput. Oper. Res..

[3]  Edmund K. Burke,et al.  A mixed integer programming model for the cyclic job-shop problem with transportation , 2012, Discret. Appl. Math..

[4]  Oya Ekin Karasan,et al.  Multiple part-type scheduling in flexible robotic cells , 2012 .

[5]  Ling Wang,et al.  An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers , 2008, Comput. Oper. Res..

[6]  Philippe Lacomme,et al.  An MILP for scheduling problems in an FMS with one vehicle , 2009, Eur. J. Oper. Res..

[7]  Peter Brucker,et al.  Cyclic job shop scheduling problems with blocking , 2008, Ann. Oper. Res..

[8]  Mehmet Fatih Tasgetiren,et al.  A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem , 2011, Comput. Ind. Eng..

[9]  P. Vasant,et al.  A Novel Hybrid Genetic Algorithms and Pattern Search Techniques for Industrial production Planning , 2012, Int. J. Model. Simul. Sci. Comput..

[10]  Irraivan Elamvazuthi,et al.  Solving deterministic non-linear programming problem using Hopfield artificial neural network and genetic programming techniques , 2012 .

[11]  R. Storer,et al.  New search spaces for sequencing problems with application to job shop scheduling , 1992 .

[12]  Pandian Vasant,et al.  Hybrid neuro-swarm optimization approach for design of distributed generation power systems , 2013, Neural Computing and Applications.

[13]  Dexian Huang,et al.  An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers , 2009, Comput. Oper. Res..

[14]  Dario Pacciarelli,et al.  Production scheduling in a steelmaking-continuous casting plant , 2004, Comput. Chem. Eng..

[15]  Fernando Jiménez,et al.  A Multi-Objective Evolutionary Approach for Fuzzy Optimization in Production Planning , 2006, 2006 IEEE International Conference on Systems, Man and Cybernetics.

[16]  Erwin Pesch,et al.  The disjunctive graph machine representation of the job shop scheduling problem , 2000, Eur. J. Oper. Res..

[17]  Sigrid Knust,et al.  Tabu search algorithms for job-shop problems with a single transport robot , 2005, Eur. J. Oper. Res..

[18]  Pandian Vasant,et al.  Hybrid LS-SA-PS methods for solving fuzzy non-linear programming problems , 2013, Math. Comput. Model..

[19]  Abdelhakim AitZai,et al.  A branch and bound and parallel genetic algorithm for the job shop scheduling problem with blocking , 2012 .

[20]  Heinz Gröflin,et al.  A new neighborhood and tabu search for the Blocking Job Shop , 2009, Discret. Appl. Math..

[21]  Józef Grabowski,et al.  Sequencing of jobs in some production system , 2000, Eur. J. Oper. Res..

[22]  Dario Pacciarelli,et al.  Job-shop scheduling with blocking and no-wait constraints , 2002, Eur. J. Oper. Res..

[23]  Rui Zhang,et al.  A hybrid immune simulated annealing algorithm for the job shop scheduling problem , 2010, Appl. Soft Comput..

[24]  Pandian Vasant.  Hybrid intelligent algorithms for industrial production planning , 2012 .

[25]  Ling Wang,et al.  Solving the blocking flow shop scheduling problem by a dynamic multi-swarm particle swarm optimizer , 2011 .

[26]  Philippe Lacomme,et al.  Job-shop based framework for simultaneous scheduling of machines and automated guided vehicles , 2013 .

[27]  Xiaoping Li,et al.  Complete local search with limited memory algorithm for no-wait job shops to minimize makespan , 2009, Eur. J. Oper. Res..

[28]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[29]  Nikolay Tchernev,et al.  A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles , 2008 .

[30]  Pei-Chann Chang,et al.  A hybrid genetic algorithm for the job shop scheduling problem with practical considerations for manufacturing costs: Investigations motivated by vehicle production , 2013 .

[31]  Takehiro Hayasaka,et al.  Multiple Exchanges of Job Orders for No-Buffer Job Shop Scheduling Problem , 2012 .

[32]  Jose M. Framiñan,et al.  An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach , 2006, Comput. Oper. Res..

[33]  Lifeng Xi,et al.  A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal , 2007, Eur. J. Oper. Res..

[34]  Dario Pacciarelli,et al.  A branch and bound algorithm for scheduling trains in a railway network , 2007, Eur. J. Oper. Res..

[35]  Mohamed F. Hassan,et al.  A hybrid GA/heuristic approach to the simultaneous scheduling of machines and automated guided vehicles , 2004 .

[36]  T. C. Wong,et al.  A comparison of hybrid genetic algorithm and hybrid particle swarm optimization to minimize makespan for assembly job shop , 2013, Appl. Soft Comput..

[37]  Imran Ali Chaudhry,et al.  Simultaneous scheduling of machines and automated guided vehicles in flexible manufacturing systems using genetic algorithms , 2011 .

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

[39]  Carlos A. Brizuela,et al.  No-wait and blocking job-shops: challenging problems for GA's , 2001, 2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236).

[40]  C.S.P. Rao,et al.  A hybrid multi-objective GA for simultaneous scheduling of machines and AGVs in FMS , 2006 .

[41]  Ling Wang,et al.  Effective heuristics for the blocking flowshop scheduling problem with makespan minimization , 2012 .

[42]  Liang Gao,et al.  An effective hybrid discrete differential evolution algorithm for the flow shop scheduling with intermediate buffers , 2011, Inf. Sci..

[43]  Dexian Huang,et al.  An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers , 2009 .

[44]  Jose M. Framiñan,et al.  Approximative procedures for no-wait job shop scheduling , 2003, Oper. Res. Lett..

[45]  Michel Gourgand,et al.  A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell , 2011, Comput. Oper. Res..

[46]  Reinhard Bürgy,et al.  The flexible blocking job shop with transfer and set-up times , 2011, J. Comb. Optim..

[47]  Gerd Finke,et al.  Scheduling of coupled tasks and one-machine no-wait robotic cells , 2009, Comput. Oper. Res..

[48]  Luis Puigjaner,et al.  Scheduling intermediate storage multipurpose batch plants using the S-graph , 2004 .

[49]  Shiji Song,et al.  hybrid differential evolution algorithm for job shop scheduling problems with xpected total tardiness criterion , 2013 .

[50]  Gündüz Ulusoy,et al.  A Time Window Approach to Simultaneous Scheduling of Machines and Material Handling System in an FMS , 1995, Oper. Res..

[51]  Xiaoping Li,et al.  An improved harmony search algorithm for blocking job shop to minimize makespan , 2012, Proceedings of the 2012 IEEE 16th International Conference on Computer Supported Cooperative Work in Design (CSCWD).

[52]  Pandian Vasant,et al.  Swarm intelligence for multi-objective optimization of synthesis gas production , 2012 .

[53]  Saul I. Gass,et al.  Erratum to "Cycling in linear programming problems" [Computers and Operations Research 31 (2002) 303-311] , 2006, Comput. Oper. Res..

[54]  Liang Gao,et al.  A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers , 2011, Appl. Soft Comput..

[55]  André Langevin,et al.  Scheduling and routing of automated guided vehicles: A hybrid approach , 2007, Comput. Oper. Res..

[56]  Gündüz Ulusoy,et al.  A genetic algorithm approach to the simultaneous scheduling of machines and automated guided vehicles , 1997, Comput. Oper. Res..

[57]  Gerd Finke,et al.  Scheduling tasks and vehicles in a flexible manufacturing system , 1991 .

[58]  Pandian Vasant,et al.  Multiobjective Optimization of Green Sand Mould System Using Chaotic Differential Evolution , 2013, Trans. Comput. Sci..

[59]  Min Liu,et al.  A High Performing Memetic Algorithm for the Flowshop Scheduling Problem With Blocking , 2013, IEEE Transactions on Automation Science and Engineering.