Study on Job Shop Scheduling Optimization with Multi-Objective

Abstract:

Article Preview

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.

Info:

Periodical:

Advanced Materials Research (Volumes 217-218)

Edited by:

Zhou Mark

Pages:

326-329

DOI:

10.4028/www.scientific.net/AMR.217-218.326

Citation:

T. Ze et al., "Study on Job Shop Scheduling Optimization with Multi-Objective", Advanced Materials Research, Vols. 217-218, pp. 326-329, 2011

Online since:

March 2011

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.