REPAIR SHOP JOB SCHEDULING WITH PARALLEL OPERATORS AND MULTIPLE CONSTRAINTS USING SIMULATED ANNEALING
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 r...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer
2013-04-01
|
| Series: | International Journal of Computational Intelligence Systems |
| Subjects: | |
| Online Access: | https://www.atlantis-press.com/article/25868381.pdf |
| _version_ | 1828844838284427264 |
|---|---|
| author | N. Shivasankaran P. Senthil Kumar G. Nallakumarasamy K. Venkatesh Raja |
| author_facet | N. Shivasankaran P. Senthil Kumar G. Nallakumarasamy K. Venkatesh Raja |
| author_sort | N. Shivasankaran |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-12T21:15:26Z |
| format | Article |
| id | doaj.art-f80aba1285d14c09a4554c3a183bdf88 |
| institution | Directory Open Access Journal |
| issn | 1875-6883 |
| language | English |
| last_indexed | 2024-12-12T21:15:26Z |
| publishDate | 2013-04-01 |
| publisher | Springer |
| record_format | Article |
| series | International Journal of Computational Intelligence Systems |
| spelling | doaj.art-f80aba1285d14c09a4554c3a183bdf882022-12-22T00:11:47ZengSpringerInternational Journal of Computational Intelligence Systems1875-68832013-04-016210.1080/18756891.2013.768434REPAIR SHOP JOB SCHEDULING WITH PARALLEL OPERATORS AND MULTIPLE CONSTRAINTS USING SIMULATED ANNEALINGN. ShivasankaranP. Senthil KumarG. NallakumarasamyK. Venkatesh RajaScheduling 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.https://www.atlantis-press.com/article/25868381.pdfCar sequencingSimulated Annealing TechniqueRepair ShopOptimizationOperator allocationCost Minimization |
| spellingShingle | N. Shivasankaran P. Senthil Kumar G. Nallakumarasamy K. Venkatesh Raja REPAIR SHOP JOB SCHEDULING WITH PARALLEL OPERATORS AND MULTIPLE CONSTRAINTS USING SIMULATED ANNEALING International Journal of Computational Intelligence Systems Car sequencing Simulated Annealing Technique Repair Shop Optimization Operator allocation Cost Minimization |
| title | REPAIR SHOP JOB SCHEDULING WITH PARALLEL OPERATORS AND MULTIPLE CONSTRAINTS USING SIMULATED ANNEALING |
| title_full | REPAIR SHOP JOB SCHEDULING WITH PARALLEL OPERATORS AND MULTIPLE CONSTRAINTS USING SIMULATED ANNEALING |
| title_fullStr | REPAIR SHOP JOB SCHEDULING WITH PARALLEL OPERATORS AND MULTIPLE CONSTRAINTS USING SIMULATED ANNEALING |
| title_full_unstemmed | REPAIR SHOP JOB SCHEDULING WITH PARALLEL OPERATORS AND MULTIPLE CONSTRAINTS USING SIMULATED ANNEALING |
| title_short | REPAIR SHOP JOB SCHEDULING WITH PARALLEL OPERATORS AND MULTIPLE CONSTRAINTS USING SIMULATED ANNEALING |
| title_sort | repair shop job scheduling with parallel operators and multiple constraints using simulated annealing |
| topic | Car sequencing Simulated Annealing Technique Repair Shop Optimization Operator allocation Cost Minimization |
| url | https://www.atlantis-press.com/article/25868381.pdf |
| work_keys_str_mv | AT nshivasankaran repairshopjobschedulingwithparalleloperatorsandmultipleconstraintsusingsimulatedannealing AT psenthilkumar repairshopjobschedulingwithparalleloperatorsandmultipleconstraintsusingsimulatedannealing AT gnallakumarasamy repairshopjobschedulingwithparalleloperatorsandmultipleconstraintsusingsimulatedannealing AT kvenkateshraja repairshopjobschedulingwithparalleloperatorsandmultipleconstraintsusingsimulatedannealing |