An Immune Algorithm Based Robust Scheduling Methods

Author(s):  
Xingquan Zuo

Inspired from the robust control principle, a robust scheduling method is proposed to solve uncertain scheduling problems. The uncertain scheduling problem is modeled by a set of workflow simulation models, and then a scheduling scheme (solution) is evaluated by the results of workflow simulations that are executed by using the workflow models in the set. A variable neighborhood immune algorithm (VNIA) is used to obtain an optimal robust scheduling scheme that has good performances for each model in the model set. The detailed steps of optimizing robust scheduling scheme by the VNIA are given. The antibody coding and decoding schemes are also designed to deal with resource conflicts during workflow simulation processes. Experimental results show that the proposed method can generate robust scheduling schemes that are insensitive for uncertain disturbances of scheduling environments.

2009 ◽  
Vol 179 (19) ◽  
pp. 3359-3369 ◽  
Author(s):  
Xingquan Zuo ◽  
Hongwei Mo ◽  
Jianping Wu

2021 ◽  
pp. 79-93
Author(s):  
Feng Deng ◽  
Shuo Chen ◽  
Hengyi Gao ◽  
Lin Qi ◽  
Bingsheng Wang

2008 ◽  
Vol 07 (02) ◽  
pp. 249-252 ◽  
Author(s):  
HELAN LIANG ◽  
SUJIAN LI

Focusing on the limitations of the traditional Continuous Casting-Direct Hot Charge Rolling (CC-DHCR) planning and scheduling methods that rarely consider dynamic scheduling problems, a new method is put forward. The key idea is to make out clusters and integrated plans in the planning layer, and then to adjust the rolling sequences according to the slab cluster-based strategy in the dynamic scheduling layer. Results of the test with data from practical production process show that the method can effectively solve the CC-DHCR planning and scheduling problem and increase the DHCR ratio.


2014 ◽  
Vol 20 (5) ◽  
pp. 649-659 ◽  
Author(s):  
Wojciech Bożejko ◽  
Zdzisław Hejducki ◽  
Mariusz Uchroński ◽  
Mieczysław Wodecki

The paper concerns the problem of roadworks scheduling executed in the flow-shop system. Works may be performed parallelly with the acceleration (overlaps) of construction project, i.e. the following work on the assembly line can begin before the completion of the predecessor work. Taking into account the acceleration enables accurate modeling of complex real construction processes. The above fact can greatly shorten the time of realization of construction process which has a direct impact on reducing costs. The considered issue belongs to the class of NP-hard problems. We introduce the new: mathematical model, specific properties as an acceleration tools, as well as two new optimization algorithms for the problem considered: construction and tabu search. The execution of algorithms was illustrated on the example of a case study concerning the construction of roads. They were also verified on the examples taken from the literature and on already completed construction processes. The obtained results are fully satisfactory. The assigned execution times are close to optimal. The presented methods allow its practitioners (both the planners and the managers) to include in the model the acceleration of the works and the design of a much more efficient construction scheduling. The presented new scheduling method leads to a more competitive environment for contraction companies.


Sign in / Sign up

Export Citation Format

Share Document