International Journal of Computational Intelligence Systems · 2013 · 11 citations · 42 references
ManagementIndustrial EngineeringOperations ManagementOptimizationProduction PlanningSchedulingCombinatorial OptimizationHeuristic OptimizationJob SchedulingJob SequencingMachine SchedulingMetaheuristic OptimizationCombinatorial Optimization HeuristicsHeuristic AlgorithmsMetaheuristic SchedulingMulti-constraint OptimizationScheduling HeuristicsSimulated AnnealingSimulated Annealing OptimizationSolution Space Exploration
Scheduling problems are generally treated as NPcomplete combinatorial optimization problems which is a multi-objective and multi constraint one. Repair shop Job sequencing and operator allocation is one such NPcomplete 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.
42
Optimization by Simulated Annealing
Scott Kirkpatrick, C. D. Gelatt, M.P. Vecchi · Science · 1983 · 44.6K citations
The Location of Emergency Service Facilities
Constantine Toregas, Ralph W. Swain, Charles ReVelle et al. · Operations Research · 1971 · 1.8K citations