Abstract
A new multi-objective scheduling method based on the GA is proposed to the job-shop scheduling problem (JSP) constrained by machines, workers. Function objectives of the proposed method are to minimize the completion time, the maximum load of machines and the total expense of machines and workers. Firstly, the mathematical model is constructed. Then, on the basis of the mathematical model, the genetic algorithm (GA) based on Pareto is applied, and an optimal or suboptimal scheduling plan can be obtained. The optimal solutions are not unique due to the multi-objective of JSP. Finally, a scheduling example is employed to illustrate that the proposed method could solve multi-objective job shop scheduling problem effectively.
Sign-in/Register to access full text options 
Free) 
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 call
