A Comparative Approach of Ant Colony System and Mathematical Programming for Task Scheduling in a Mineral Analysis Laboratory
| Autor: | Miguel Rojas Santiago, Daniel Alfonso Mendoza Casseres, Dionicio Neira Rodado, Fabricio Andres Niebles Atencio, Alexander Bustacara Prasca |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
0209 industrial biotechnology
Mathematical optimization Job shop scheduling Computer science Comparative method Ant colony optimization algorithms Tardiness 02 engineering and technology Ant colony Multi-objective optimization Scheduling (computing) 020901 industrial engineering & automation 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Metaheuristic |
| Zdroj: | Lecture Notes in Computer Science ISBN: 9783319409993 ICSI (1) |
| DOI: | 10.1007/978-3-319-41000-5_41 |
| Popis: | This paper considers the problem of scheduling a given set of samples in a mineral laboratory, located in Barranquilla Colombia. Taking into account the natural complexity of the process and the large amount of variables involved, this problem is considered as NP-hard in strong sense. Therefore, it is possible to find an optimal solution in a reasonable computational time only for small instances, which in general, does not reflect the industrial reality. For that reason, it is proposed the use of metaheuristics as an alternative approach in this problem with the aim to determine, with a low computational effort, the best assignation of the analysis in order to minimize the makespan and weighted total tardiness simultaneously. These optimization objectives will allow this laboratory to improve their productivity and the customer service, respectively. A Ant Colony Optimization algorithm (ACO) is proposed. Computational experiments are carried out comparing the proposed approach versus exact methods. Results show the efficiency of our ACO algorithm. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|