A computer simulation model for job shop scheduling problems minimizing makespan

One of the basic and significant problems, that a shop or a factory manager is encountered, is a suitable scheduling and sequencing of jobs on machines. One type of scheduling problem is job shop scheduling. There are different machines in a shop of which a job may require some or all these machines in some specific sequence. For solving this problem, the objective may be to minimize the makespan. After optimizing the makespan, the jobs sequencing must be carried out for each machine. The above problem can be solved by a number of different methods such as branch and bound, cutting plane, heuristic methods, etc. In recent years, researches have used genetic algorithms, simulated annealing, and machine learning methods for solving such problems. In this paper, a simulation model is presented to work out job shop scheduling problems with the objective of minimizing makespan. The model has been coded by Visual SLAM which is a special simulation language. The structure of this language is based on the network modeling. After modeling the scheduling problem, the model is verified and validated. Then the computational results are presented and compared with other results reported in the literature. Finally, the model output is analyzed.

[1]  C.K. Wong,et al.  Two simulated annealing-based heuristics for the job shop scheduling problem , 1999, Eur. J. Oper. Res..

[2]  Haibin Yu,et al.  Neural network and genetic algorithm-based hybrid approach to expanded job-shop scheduling , 2001 .

[3]  Liang-Hsuan Chen,et al.  An intelligent interface between symbolic and numeric analysis tools required for the development of an integrated CAD system , 1996 .

[4]  Chung Yee Lee,et al.  Job shop scheduling with a genetic algorithm and machine learning , 1997 .

[5]  Emre A. Veral.  Computer simulation of due-date setting in multi-machine job shops , 2001 .

[6]  Ihsan Sabuncuoglu,et al.  Analysis of reactive scheduling problems in a job shop environment , 2000, Eur. J. Oper. Res..

[7]  梁炜,et al.  Neural network and genetic algorithm-based hybrid approach to expanded job-shop scheduling , 2001 .

[8]  Mitsuo Gen,et al.  A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem , 2005, Comput. Ind. Eng..

[9]  Alain Guinet,et al.  Efficiency of reductions of job-shop to flow-shop problems , 2000, Eur. J. Oper. Res..

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

[11]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[12]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[13]  Jeffrey S. Smith,et al.  Simulation system for real-time planning, scheduling, and control , 1996, Proceedings Winter Simulation Conference.

[14]  Katsuhiko Takahashi,et al.  Simulated annealing approach for minimizing the makespan of the general job-shop , 1999 .

[15]  Edem O. P. Akpan.  Job‐shop sequencing problems via network scheduling technique , 1996 .

[16]  Lucio Bianco,et al.  Minimizing makespan in a multimode multiprocessor shop scheduling problem , 1999 .

[17]  Helena Ramalhinho Dias Lourenço,et al.  Job-shop scheduling: Computational study of local search and large-step optimization methods , 1995 .

[18]  Yoke San Wong,et al.  Dynamic selection of dispatching rules for job shop scheduling , 2000 .

[19]  A. Alan B. Pritsker,et al.  Simulation with Visual SLAM and AweSim , 1997 .

[20]  Nikolay Tchernev,et al.  Generic simulation model for hybrid flow-shop , 1999 .

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