A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Genetic Algorithms with Feasible Operators for Solving Job Shop Scheduling Problem
2020
Journal of scientific research
Job scheduling is one of the key activities performed in industries for manufacturing planning. In job scheduling, each job that contains various operations is allocated to one of the available machines for processing. Each job has a duration and each machine can handle only one operation at a time. An efficient allocation of jobs is mandatory for decreasing the makespan and idle time of the machines. In Job Shop Scheduling (JSS), the operations of the jobs are ordered. Genetic algorithm (GA)
doi:10.37398/jsr.2020.640157
fatcat:go7lsd2kongrdnckvwb4bkwb6m