An evolutionary approach for solving the job shop scheduling problem in a service industry
International Journal of Advances in Intelligent Informatics
View Publication InfoField | Value | |
Title |
An evolutionary approach for solving the job shop scheduling problem in a service industry
|
|
Creator |
Yousefi, Milad
Yousefi, Moslem Hooshyar, Danial Ataide de Souza Oliveira, Jefferson |
|
Subject |
Scheduling; Job shop scheduling problem; Optimization; Discrete particle swarm optimization
|
|
Description |
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.
|
|
Publisher |
Universitas Ahmad Dahlan
|
|
Contributor |
—
|
|
Date |
2015-03-29
|
|
Type |
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion — |
|
Format |
application/pdf
|
|
Identifier |
http://ijain.org/index.php/IJAIN/article/view/5
10.26555/ijain.v1i1.5 |
|
Source |
International Journal of Advances in Intelligent Informatics; Vol 1, No 1 (2015): March 2015; 1-6
2548-3161 2442-6571 |
|
Language |
eng
|
|
Relation |
http://ijain.org/index.php/IJAIN/article/view/5/1
|
|
Rights |
Copyright (c) 2015 International Journal of Advances in Intelligent Informatics
https://creativecommons.org/licenses/by-sa/4.0 |
|