Research on steady-state simulation in dynamic job shop scheduling problem

A systematic research of steady state for the dynamic job shop scheduling problem with jobs releasing continuously over time has been conducted in this article. A simulation scheduling test for the purpose of factor analysis is designed and carried out first and then another simulation scheduling test for the purposes of disciplinarian investigation is conducted. The heuristic dispatching rule algorithm is adopted in the simulation scheduling. The test data are processed and analyzed using SPSS13.0. The results indicated that the dominant factor that can characterize the shop steady state is the shop utilization level. Besides, the relationship between the number of jobs arrived at the shop and the steady state of the shop can be described by a quadratic curve preferably. Results obtained in this article make significant sense for the study of simulation scheduling of dynamic job shop scheduling problem and also for the optimum design of the shop system.

[1]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[2]  Chandrasekharan Rajendran,et al.  A comparative study of dispatching rules in dynamic flowshops and jobshops , 1999, Eur. J. Oper. Res..

[3]  Liang Gao,et al.  A GEP-based reactive scheduling policies constructing approach for dynamic flexible job shop scheduling problem with job release dates , 2013, J. Intell. Manuf..

[4]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[5]  Marc M. Van Hulle.  A goal programming network for linear programming , 2004, Biological Cybernetics.

[6]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[7]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[8]  Peigen Li,et al.  A New Hybrid GA/SA Algorithm for the Job Shop Scheduling Problem , 2005, EvoCOP.

[9]  Chandrasekharan Rajendran,et al.  Efficient dispatching rules for scheduling in a job shop , 1997 .

[10]  Éric D. Taillard,et al.  Parallel Taboo Search Techniques for the Job Shop Scheduling Problem , 1994, INFORMS J. Comput..

[11]  Ram Rachamadugu,et al.  Performance of dispatching rules under perfect sequencing flexibility , 1990, 1990 Winter Simulation Conference Proceedings.

[12]  Hegen Xiong,et al.  HEURISTIC METHOD FOR DYNAMIC JOB SHOP SCHEDULING PROBLEM WITH OPERATION RELATIVITY , 2006 .

[13]  Ranga V. Ramasesh.  Dynamic job shop scheduling: A survey of simulation research , 1990 .

[14]  D. Y. Sha,et al.  A dispatching rule for photolithography scheduling with an on-line rework strategy , 2006, Comput. Ind. Eng..

[15]  Harvey J. Greenberg,et al.  New approaches for heuristic search: A bilateral linkage with artificial intelligence , 1989 .

[16]  Liang Gao,et al.  An effective genetic algorithm for the flexible job-shop scheduling problem , 2011, Expert Syst. Appl..

[17]  Xinyu Li,et al.  A hybrid intelligent algorithm and rescheduling technique for job shop scheduling problems with disruptions , 2013 .

[18]  Chandrasekharan Rajendran,et al.  Development and analysis of cost-based dispatching rules for job shop scheduling , 2004, Eur. J. Oper. Res..

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

[20]  Don T. Phillips,et al.  A state-of-the-art survey of dispatching rules for manufacturing job shop operations , 1982 .

[21]  Egon Balas,et al.  Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..

[22]  Liang Gao.  PSO BASED SCHEDULING ALGORITHM FOR OPEN SHOP SCHEDULING PROBLEM , 2006 .

[23]  Oliver Holthaus,et al.  Scheduling in job shops with machine breakdowns: an experimental study , 1999 .