An evolutionary approach for solving the job shop scheduling problem in a service industry
| Autor: | Milad Yousefi, Moslem Yousefi, Danial Hooshyar, Jefferson Ataide de Souza Oliveira |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2015 |
| Předmět: | |
| Zdroj: | IJAIN (International Journal of Advances in Intelligent Informatics), Vol 1, Iss 1, Pp 1-6 (2015) |
| Druh dokumentu: | article |
| ISSN: | 2442-6571 2548-3161 |
| DOI: | 10.26555/ijain.v1i1.5 |
| Popis: | In this paper, an evolutionary-based approach based on the discrete particle swarm optimization (DPSO) algorithm is developed for finding the optimum schedule of a registration problem in a university. Minimizing the makespan, which is the total length of the schedule, in a real-world case study is considered as the target function. Since the selected case study has the characteristics of job shop scheduling problem (JSSP), it is categorized as a NP-hard problem which makes it difficult to be solved by conventional mathematical approaches in relatively short computation time. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|