REPAIR SHOP JOB SCHEDULING WITH PARALLEL OPERATORS AND MULTIPLE CONSTRAINTS USING SIMULATED ANNEALING
| Autor: | K. Venkatesh Raja, P. Senthil Kumar, N. Shivasankaran, G. Nallakumarasamy |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2013 |
| Předmět: |
Job scheduler
Optimization Mathematical optimization General Computer Science Cost Minimization Combinatorial optimization problem Flow shop scheduling computer.software_genre lcsh:QA75.5-76.95 Scheduling (computing) Computational Mathematics Repair Shop Operator allocation Car sequencing Simulated annealing Simulated Annealing Technique Multiple constraints Repair shop lcsh:Electronic computers. Computer science Bitwise operation computer Mathematics |
| Zdroj: | International Journal of Computational Intelligence Systems, Vol 6, Iss 2 (2013) International Journal of Computational Intelligence Systems, Vol 6, Iss 2, Pp 223-233 (2013) |
| ISSN: | 1875-6883 |
| Popis: | Scheduling problems are generally treated as NP andash; complete combinatorial optimization problems which is a multi-objective and multi constraint one. Repair shop Job sequencing and operator allocation is one such NP andash; 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink