Genetic optimization of order scheduling with multiple uncertainties

作者:

Highlights:

摘要

In this paper, the order scheduling problem at the factory level, aiming at scheduling the production processes of each production order to different assembly lines is investigated. Various uncertainties, including uncertain processing time, uncertain orders and uncertain arrival times, are considered and described as random variables. A mathematical model for this order scheduling problem is presented with the objectives of maximizing the total satisfaction level of all orders and minimizing their total throughput time. Uncertain completion time and beginning time of production process are derived firstly by using probability theory. A genetic algorithm, in which the representation with variable length of sub-chromosome is presented, is developed to generate the optimal order scheduling solution. Experiments are conducted to validate the proposed algorithm by using real-world production data. The experimental results show the effectiveness of the proposed algorithm.

论文关键词:Order scheduling,Uncertain processing time,Probability theory,Genetic algorithms

论文评审过程:Available online 11 September 2007.

论文官网地址:https://doi.org/10.1016/j.eswa.2007.08.058