No image available for this title

Text

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 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.


Availability

PO000009IDperpusonline.idAvailable

Detail Information

Series Title
International Journal of Advances in Intelligent Informatics Vol 1, No 1, March 2015
Call Number
-
Publisher : .,
Collation
-
Language
English
ISBN/ISSN
2442-6571
Classification
NONE
Content Type
-
Media Type
-
Carrier Type
-
Edition
-
Subject(s)
Specific Detail Info
-
Statement of Responsibility

Other version/related

No other version available


File Attachment



Information


RECORD DETAIL


Back To PreviousXML DetailCite this