Adaptive Hybrid ant colony optimization for solving Dual Resource Constrained Job Shop Scheduling Problem

This paper presents a scheduling approach, based on Ant Colony Optimization (ACO), developed to address the scheduling problem in manufacturing systems constrained by both machines and heterogeneous workers called as Dual Resource Constrained Job Shop Scheduling Problem with Heterogeneous Workers. This hybrid algorithm utilizes the combination of ACO and Simulated Annealing (SA) algorithm and proposes a n adaptive control mechanism based on ant flow of route choice to improve the global search ability. Two adaptive adjusting schemes of parameter s based on iteration times and quality of solutions respectively are imposed to actualize the performance optimization by stages. Then the performances of different optimization methods with different resource allocation strategies are compared according to simulation experiments on both concrete instance and random benchmarks while related discussion are represented at last.

[1]  Gary D. Scudder,et al.  Comparing performance measures in dynamic job shops: economics vs. time , 1993 .

[2]  Pan Quan-ke.  Job Shop Scheduling for Decreasing Production Costs , 2004 .

[3]  Oded Berman,et al.  A queueing control model for retail services having back room operations and cross-trained workers , 2004, Comput. Oper. Res..

[4]  Hoda A. ElMaraghy,et al.  Scheduling of manufacturing systems under dual-resource constraints using genetic algorithms , 2000 .

[5]  Li Shu.  Mix optimization scheduling approach for multi-resource job-shop , 2007 .

[6]  Yuan Yang.  Novel ant colony optimization algorithm for robot path planning , 2008 .

[7]  Peng Wang,et al.  A Knowledge-Based Ant Colony Optimization for Flexible Job Shop Scheduling Problems , 2010, Appl. Soft Comput..

[8]  Xue Feng.  ACGA with adapting parameters based on cloud models , 2009 .

[9]  Ching-Jong Liao,et al.  Ant colony optimization combined with taboo search for the job shop scheduling problem , 2008, Comput. Oper. Res..

[10]  G. J. C. Gaalman,et al.  On the who-rule in Dual Resource Constrained (DRC) manufacturing systems , 2004 .

[11]  Hao Chang-zhong.  Flexible Job Shop Scheduling for Decreasing Production Costs , 2008 .

[12]  Mark D. Treleven.  A Review of the Dual Resource Constrained System Research , 1989 .

[13]  Marco Dorigo,et al.  Ant colony optimization theory: A survey , 2005, Theor. Comput. Sci..

[14]  Dirk Helbing,et al.  Optimal traffic organization in ants under crowded conditions , 2004, Nature.

[15]  Dorothy Ndedi Monekosso,et al.  A review of ant algorithms , 2009, Expert Syst. Appl..

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

[17]  P. Brunn,et al.  Workshop scheduling using practical (inaccurate) data Part 2: An investigation of the robustness of scheduling rules in a dynamic and stochastic environment , 1999 .

[18]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[19]  Wang Chen,et al.  An efficient hybrid algorithm for resource-constrained project scheduling , 2010, Inf. Sci..

[20]  Giovanni Righini,et al.  Heuristics from Nature for Hard Combinatorial Optimization Problems , 1996 .

[21]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[22]  Ching-Jong Liao,et al.  An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups , 2007, Comput. Oper. Res..

[23]  Mehmet Mutlu Yenisey,et al.  Ant colony optimization for multi-objective flow shop scheduling problem , 2008, Comput. Ind. Eng..

[24]  P. Brunn,et al.  Workshop scheduling using practical (inaccurate) data Part 1: The performance of heuristic scheduling rules in a dynamic job shop environment using a rolling time horizon approach , 1999 .

[25]  Christian Blum,et al.  Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling , 2005, Comput. Oper. Res..

[26]  Wu Xue-jing.  Hybrid ant colony optimization algorithm for unrelated parallel machine scheduling problem , 2008 .

[27]  Latif Salum,et al.  Using the when/where rules in dual resource constrained systems for a hybrid push-pull control , 2009 .

[28]  A. Tamilarasi,et al.  Hybridizing tabu search with ant colony optimization for solving job shop scheduling problems , 2009 .

[29]  Mark Treleven.  THE TIMING OF LABOR TRANSFERS IN DUAL RESOURCE‐CONSTRAINED SYSTEMS: “PUSH” VS. “PULL” RULES* , 1987 .

[30]  B. Bullnheimer,et al.  A NEW RANK BASED VERSION OF THE ANT SYSTEM: A COMPUTATIONAL STUDY , 1997 .

[31]  Hemant V. Kher.  Examination of worker assignment and dispatching rules for managing vital customer priorities in dual resource constrained job shop environments , 2000, Comput. Oper. Res..

[32]  Li Shu-juan.  Multi-resource Constrained Job-shop Optimization Scheduling Based on Ant Colony Algorithm , 2007 .

[33]  R. T. Nelson.  Labor and Machine Limited Production Systems , 1967 .

[34]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[35]  Andrea Rossi,et al.  Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method , 2007 .

[36]  T. Stützle,et al.  A Review on the Ant Colony Optimization Metaheuristic: Basis, Models and New Trends , 2002 .

[37]  Gerard Gaalman,et al.  Cross-training workers in Dual Resource Constrained systems with heterogeneous processing times , 2009 .