title:
 
REPAIR SHOP JOB SCHEDULING WITH PARALLEL OPERATORS AND MULTIPLE CONSTRAINTS USING SIMULATED ANNEALING
publication:
 
IJCIS
volume-issue:   6 - 2
pages:   223 - 233
ISSN:
  1875-6883
DOI:
  doi:10.1080/18756891.2013.768434 (how to use a DOI)
author(s):
 
N. Shivasankaran, P. Senthil Kumar, G. Nallakumarasamy, K. Venkatesh Raja
publication date:
 
April 2013
keywords:
 
Car sequencing, Simulated Annealing Technique, Repair Shop, Optimization, Operator allocation, Cost Minimization
abstract:
 
Scheduling problems are generally treated as NP – complete combinatorial optimization problems which is a multi-objective and multi constraint one. Repair shop Job sequencing and operator allocation is one such NP – complete problem. For such problems, an efficient technique is required that explores a wide range of solution space. This paper deals with Simulated Annealing Technique, a Meta - heuristic to solve the complex Car Sequencing and Operator Allocation problem in a car repair shop. The algorithm is tested with several constraint settings and the solution quality exceeds the results reported in the literature with high convergence speed and accuracy. This algorithm could be considered as quite effective while other heuristic routine fails.
copyright:
 
Atlantis Press. This article is distributed under the terms of the Creative Commons Attribution License, which permits non-commercial use, distribution and reproduction in any medium, provided the original work is properly cited.
full text: