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.
Real Time Impact Factor:
Pending
Author Name: Milad Yousefi, Moslem Yousefi, Danial Hooshyar, Jefferson Ataide de Souza Oliveira
URL: View PDF
Keywords: Scheduling; Job shop scheduling problem; Optimization; Discrete particle swarm optimization
ISSN:
EISSN: 2442-6571
EOI/DOI:
Add Citation
Views: 1704
