Parallel processor scheduling for minimizing total weighted tardiness using ant colony optimization
| Autor: | N. R. Srinivasa Raghavan, M. Venkataramana |
|---|---|
| Rok vydání: | 2008 |
| Předmět: |
Engineering
Mathematical optimization Job shop scheduling business.industry Efficient algorithm Mechanical Engineering Ant colony optimization algorithms Tardiness Industrial and Manufacturing Engineering Computer Science Applications Business environment Scheduling (computing) Control and Systems Engineering Heuristics business Metaheuristic Software |
| Zdroj: | The International Journal of Advanced Manufacturing Technology. 41:986-996 |
| ISSN: | 1433-3015 0268-3768 |
| DOI: | 10.1007/s00170-008-1544-z |
| Popis: | In the modern business environment, meeting due dates and avoiding delay penalties are very important goals that can be accomplished by minimizing total weighted tardiness. We consider a scheduling problem in a system of parallel processors with the objective of minimizing total weighted tardiness. Our aim in the present work is to develop an efficient algorithm for solving the parallel processor problem as compared to the available heuristics in the literature and we propose the ant colony optimization approach for this problem. An extensive experimentation is conducted to evaluate the performance of the ACO approach on different problem sizes with the varied tardiness factors. Our experimentation shows that the proposed ant colony optimization algorithm is giving promising results compared to the best of the available heuristics. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink