scholarly journals In-Space Crew-Collaborative Task Scheduling

Author(s):  
John Jaap ◽  
Patrick Meyer ◽  
Elizabeth Davis ◽  
Lea Richardson
IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 216593-216606
Author(s):  
Youngjin Kim ◽  
Chiwon Song ◽  
Hyuck Han ◽  
Hyungsoo Jung ◽  
Sooyong Kang

2021 ◽  
pp. 1-24
Author(s):  
Ziwei Dai ◽  
Zhiyong Zhang ◽  
Mingzhou Chen

Task scheduling is important in cloud manufacturing because of customers’ increasingly individualized demands. However, when various changes occur, a previous optimal schedule may become non-optimal or even infeasible owing to the uncertainty of the real manufacturing environment where dynamic task arrival over time is a vital source. In this paper, we propose a novel collaborative task scheduling (CTS) model dealing with new task arrival which considers multi-supply chain collaboration. We present an improved multi-population biogeography-based optimization (IMPBBO) algorithm that uses a matrix-based solution representation and integrates the multi-population strategy, local search for the best solution, and the collaboration mechanism, for determining the optimal schedule. A series of experiments are conducted for verifying the effectiveness of the IMPBBO algorithm for solving the CTS model by comparing it with five other algorithms. The experimental results concerning average best values obtained by the IMPBBO algorithm are better than that obtained by comparison algorithms for 41 out of 45 cases, showing its superior performance. Wilcoxon-test has been employed to strengthen the fact that IMPBBO algorithm performs better than five comparison algorithms.


2006 ◽  
Author(s):  
Patrice D. Tremoulet ◽  
Kathleen M. Stibler ◽  
Patrick Craven ◽  
Joyce Barton ◽  
Adam Gifford ◽  
...  

Author(s):  
Shailendra Raghuvanshi ◽  
Priyanka Dubey

Load balancing of non-preemptive independent tasks on virtual machines (VMs) is an important aspect of task scheduling in clouds. Whenever certain VMs are overloaded and remaining VMs are under loaded with tasks for processing, the load has to be balanced to achieve optimal machine utilization. In this paper, we propose an algorithm named honey bee behavior inspired load balancing, which aims to achieve well balanced load across virtual machines for maximizing the throughput. The proposed algorithm also balances the priorities of tasks on the machines in such a way that the amount of waiting time of the tasks in the queue is minimal. We have compared the proposed algorithm with existing load balancing and scheduling algorithms. The experimental results show that the algorithm is effective when compared with existing algorithms. Our approach illustrates that there is a significant improvement in average execution time and reduction in waiting time of tasks on queue using workflowsim simulator in JAVA.


Sign in / Sign up

Export Citation Format

Share Document