A Self-adaptive PSO-Based Dynamic Scheduling Method on Hierarchical Cloud Computing

2020 ◽  
pp. 89-100
Author(s):  
Shunmei Meng ◽  
Weijia Huang ◽  
Xiaolong Xu ◽  
Qianmu Li ◽  
Wanchun Dou ◽  
...  
Keyword(s):  
Cloud Computing ◽  
Dynamic Scheduling ◽  
Adaptive Pso ◽  
Scheduling Method ◽  
Self Adaptive

A fault‐tolerant dynamic scheduling method on hierarchical mobile edge cloud computing

2019 ◽  
Vol 35 (3) ◽  
pp. 577-598
Author(s):  
Shunmei Meng ◽  
Qianmu Li ◽  
Taoran Wu ◽  
Weijia Huang ◽  
Jing Zhang ◽  
...  
Keyword(s):  
Cloud Computing ◽  
Dynamic Scheduling ◽  
Fault Tolerant ◽  
Scheduling Method

scholarly journals A Building-Block-Based Genetic Algorithm for Solving the Robots Allocation Problem in a Robotic Mobile Fulfilment System

2019 ◽  
Vol 2019 ◽  
pp. 1-15
Author(s):  
Jingtian Zhang ◽  
Fuxing Yang ◽  
Xun Weng
Keyword(s):  
Genetic Algorithm ◽  
Dynamic Scheduling ◽  
Building Blocks ◽  
Allocation Problem ◽  
Accurate Analysis ◽  
Allocation Problems ◽  
Scheduling Method ◽  
Project Scheduling Problem ◽  
Block Based ◽  
Better Than

Robotic mobile fulfilment system (RMFS) is an efficient and flexible order picking system where robots ship the movable shelves with items to the picking stations. This innovative parts-to-picker system, known as Kiva system, is especially suited for e-commerce fulfilment centres and has been widely used in practice. However, there are lots of resource allocation problems in RMFS. The robots allocation problem of deciding which robot will be allocated to a delivery task has a significant impact on the productivity of the whole system. We model this problem as a resource-constrained project scheduling problem with transfer times (RCPSPTT) based on the accurate analysis of driving and delivering behaviour of robots. A dedicated serial schedule generation scheme and a genetic algorithm using building-blocks-based crossover (BBX) operator are proposed to solve this problem. The designed algorithm can be combined into a dynamic scheduling structure or used as the basis of calculation for other allocation problems. Experiment instances are generated based on the characteristics of RMFS, and the computation results show that the proposed algorithm outperforms the traditional rule-based scheduling method. The BBX operator is rapid and efficient which performs better than several classic and competitive crossover operators.

Research of Flexible Dynamic Scheduling Problem Based on Genetic Algorithm

2009 ◽  
Vol 16-19 ◽  
pp. 743-747
Author(s):  
Yu Wu ◽  
Xin Cun Zhuang ◽  
Cong Xin Li
Keyword(s):  
Genetic Algorithm ◽  
Flexible Manufacturing ◽  
Manufacturing Systems ◽  
Dynamic Scheduling ◽  
Scheduling Problem ◽  
Static Scheduling ◽  
Coding Method ◽  
Scheduling Method ◽  
Distribution Principle ◽  
Working Procedure

Solve the flexible dynamic scheduling problem by using “dynamic management & static scheduling” method. Aim at the property of flexible Manufacturing systems, the dynamic scheduling methods are analyzed and a coding method based on working procedure is improved in this paper. Thus it can be efficiently solve the problem of multiple working routes selection under the active distribution principle. On the other hand, the self-adaptive gene is provided and the parameters of the genetic algorithm are defined. In such a solution, the scheduling is confirmed to be simple and efficient.

A dynamic scheduling method for irregular parallel programs

1992 ◽  
Vol 27 (7) ◽  
pp. 200-211 ◽  
Author(s):  
Steven Lucco
Keyword(s):  
Dynamic Scheduling ◽  
Parallel Programs ◽  
Scheduling Method
Sign in / Sign up

Export Citation Format

Share Document