REPAIR SHOP JOB SCHEDULING WITH PARALLEL OPERATORS AND MULTIPLE CONSTRAINTS USING SIMULATED ANNEALING

DOI

10.1080/18756891.2013.768434How to use a DOI?

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

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - JOUR
AU  - N. Shivasankaran
AU  - P. Senthil Kumar
AU  - G. Nallakumarasamy
AU  - K. Venkatesh Raja
PY  - 2013
DA  - 2013/03/01
TI  - REPAIR SHOP JOB SCHEDULING WITH PARALLEL OPERATORS AND MULTIPLE CONSTRAINTS USING SIMULATED ANNEALING
JO  - International Journal of Computational Intelligence Systems
SP  - 223
EP  - 233
VL  - 6
IS  - 2
SN  - 1875-6883
UR  - https://doi.org/10.1080/18756891.2013.768434
DO  - 10.1080/18756891.2013.768434
ID  - Shivasankaran2013
ER  -