An evolutionary approach for solving the job shop scheduling problem in a service industry
Journal Title: International Journal of Advances in Intelligent Informatics - Year 2015, Vol 1, Issue 2
Abstract
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. In order to clarify the problem and the proposed solution a small instance discusses then the problem with the real data is solved. 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.
Authors and Affiliations
Milad Yousefi, Moslem Yousefi, Danial Hooshyar, Jefferson Ataide de Souza Oliveira
Keywords
Related Articles
- EP ID EP207768
- DOI 10.26555/ijain.v1i1.5
- Views 89
- Downloads 0
An evolutionary approach for solving the job shop scheduling problem in a service industry
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 mak...