Scheduling is one of the most important processes in an industry both in manufacturingand services. The scheduling process is the process of selecting resources to perform an operation on tasks. Resources can be machines, peoples, tasks, jobs or operations.. The selection of optimum sequence of jobs from a permutation is an essential issue in every research in scheduling problem. Optimum sequence becomes optimum solution to resolve scheduling problem. Scheduling problem becomes NP-hard problem since the number of job in the sequence is more than normal number can be processed by exact algorithm. In order to obtain optimum results, it needs a method with capability to solve complex scheduling problems in an acceptable time. Meta-heuristic is a method usually used to solve scheduling problem. The recently published method called Crow Search Algorithm (CSA) is adopted in this research to solve scheduling problem. CSA is an evolutionary meta-heuristic method which is based on the behavior in flocks of crow. The calculation result of CSA for solving scheduling problem is compared with other algorithms. From the comparison, it is found that CSA has better performance in term of optimum solution and time calculation than other algorithms.

Original languageEnglish
Article number012003
JournalIOP Conference Series: Materials Science and Engineering
Issue number1
Publication statusPublished - 10 Apr 2018
Event1st International Conference on Industrial and Systems Engineering, IConISE 2017 - Denpasar, Bali, Indonesia
Duration: 29 Aug 201730 Aug 2017


Dive into the research topics of 'A meta-heuristic method for solving scheduling problem: Crow search algorithm'. Together they form a unique fingerprint.

Cite this