期刊名称：IJAIN (International Journal of Advances in Intelligent Informatics)
印刷版ISSN：2442-6571
电子版ISSN：2548-3161
出版年度：2015
卷号：1
期号：1
页码：1-6
DOI：10.26555/ijain.v1i1.5
语种：English
出版社：Universitas Ahmad Dahlan
摘要：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.
