A computer simulation model for job shop scheduling problems minimizing makespan

  • Authors:

  • R. Tavakkoli-Moghaddam;M. Daneshmand-Mehr

  • Affiliations:

  • Department of Industrial Engineering, Faculty of Engineering, University of Tehran, P.O. Box 11365-4563, Tehran, Iran;Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran

  • Venue:
  • Computers and Industrial Engineering - Special issue: Selected papers from the 30th international conference on computers; industrial engineering
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.