Abstract
The job scheduling problem is used in industry, manufacturing, job planning, and the network environment to manage users’ jobs on the right machines with different limitations. There are three types of job scheduling problems. Firstly, job shop scheduling means each job is executed on a determined sequence of machines specified previously. While in the flow shop scheduling problem, each job can be carried on one idle sequencing using a job queue. The third type, open shop, the sequence of jobs can be carried out on any free machine. This paper describes the various types of job scheduling problems and the various swarm intelligence algorithms, particularly cuckoo search algorithm, that can used to solve them.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Al-Qadisiyah for Computer Science and Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
