Heuristic Scheduling Method with the Importance of Earlier Tasks for Deadline Constrained Workflows in Clouds

2021 ◽  
Author(s):  
Liwen Yang ◽  
Yuanqing Xia ◽  
Lingjuan Ye
Keyword(s):  
Heuristic Scheduling ◽  
Scheduling Method

scholarly journals A FlexRay Dynamic Segment Message Scheduling Optimization Algorithm*

2018 ◽  
Vol 232 ◽  
pp. 03035
Author(s):  
Liangyu Zhang ◽  
Yi Wang
Keyword(s):  
Response Time ◽  
Collaborative Design ◽  
Scheduling Algorithm ◽  
Matlab Simulation ◽  
Worst Case ◽  
Message Scheduling ◽  
Heuristic Scheduling ◽  
Scheduling Method ◽  
Scheduling Optimization Algorithm ◽  
Case Response

In this paper, we present a new heuristic scheduling algorithm basing on DM algorithm, which makes up for the deficiency of the currently very little collaborative design of FlexRay dynamic segment scheduling method with the worst response time and bus utilization. The algorithm improves the comprehensive efficiency of message worst-case response time and uses bus utilization as the optimization target, and the best FID allocation scheme is obtained. The MATLAB simulation experiment of the scheduling scheme obtained good simulation results.

scholarly journals Heuristic algorithm for single resource constrained project scheduling problem based on the dynamic programming

2009 ◽  
Vol 19 (2) ◽  
pp. 281-298 ◽  
Author(s):  
Ivan Stanimirovic ◽  
Marko Petkovic ◽  
Predrag Stanimirovic ◽  
Miroslav Ciric
Keyword(s):  
Dynamic Programming ◽  
Project Scheduling ◽  
Heuristic Method ◽  
Scheduling Problem ◽  
Resource Constrained ◽  
Resource Constrained Project Scheduling ◽  
Heuristic Scheduling ◽  
Scheduling Method ◽  
Project Scheduling Problem ◽  
Programming Solution

We introduce a heuristic method for the single resource constrained project scheduling problem, based on the dynamic programming solution of the knapsack problem. This method schedules projects with one type of resources, in the non-preemptive case: once started an activity is not interrupted and runs to completion. We compare the implementation of this method with well-known heuristic scheduling method, called Minimum Slack First (known also as Gray-Kidd algorithm), as well as with Microsoft Project.

Aging-Aware Task Scheduling for Mesh-Based Network-on-Chips Under Aging Effect

2019 ◽  
Vol 28 (09) ◽  
pp. 1950146 ◽  
Author(s):  
Jinbin Tu ◽  
Tianhao Yang ◽  
Lu Yin ◽  
Shuangyu Xie ◽  
Ruitao Xu ◽  
...  
Keyword(s):  
Task Scheduling ◽  
Aging Effect ◽  
Performance Degradation ◽  
Path Delay ◽  
Negative Bias Temperature Instability ◽  
Processor Core ◽  
Bias Temperature Instability ◽  
Heuristic Scheduling ◽  
Scheduling Method ◽  
On Chip

The aging effect induced by negative bias temperature instability (NBTI) is a universal issue existing in electronic equipments. NBTI aging effect can increase the path delay of network-on-chip (NoC) device, resulting in the decreased frequency of processor core and in turn its performance degradation. Under this circumstance, aging-aware task scheduling becomes a complex and challenging problem in advanced multicore systems. This paper presents an aging-aware scheduling method that incorporates NBTI aging effect into the task scheduling framework for mesh-based NoCs. The proposed method relies on a NBTI aging model to evaluate the degradation of core’s operating frequency to establish the task scheduling model under aging effect. Taking into account core performance degradation and the communication overheads among cores, we develop a meta-heuristic scheduling strategy based on particle swarm optimization algorithm to minimize the total execution time of all tasks. Experimental results show that the schedule obtained by the aging-aware algorithm has shorter completion time and higher throughput compared with the nonaging-aware case. On average, the makespan can be reduced by 13.55% and the throughput can be increased by 21.73% for a variety of benchmark applications.

Research of Multi-Satellite TT&C Scheduling Problem

2012 ◽  
Vol 263-266 ◽  
pp. 476-484 ◽  
Author(s):  
Xiao Dong Ling ◽  
Wei Kang Zhu ◽  
Jin Mei Wu ◽  
Xiao Yue Wu
Keyword(s):  
Scheduling Problem ◽  
Important Thing ◽  
Heuristic Scheduling ◽  
Scheduling Method ◽  
Level Design ◽  
High Level

Multi-Satellite TT&C Scheduling Problem（MuSTSP） is to the keypoint of help doing high level design for space TT&C network and the conflict is the most important thing which result in MuSTSP. In this paper, the conflict is aboratively analyzed. Some new conceptions are proposed. Then a new heuristic scheduling method based on conflict-resolvation is introduced. A simple example is given to elaborate the feasibility of this method.

PSO and WCR-Based Scheduling Algorithm for Non-Identical Semiconductor Batch Processing Devices

2011 ◽  
Vol 186 ◽  
pp. 46-50
Author(s):  
Bing Hai Zhou
Keyword(s):  
Performance Test ◽  
Scheduling Algorithm ◽  
Batch Processing ◽  
Due Dates ◽  
Cost Rate ◽  
Heuristic Scheduling ◽  
Scheduling Method ◽  
And Performance ◽  
Weighted Earliness ◽  
Test Operations

In semiconductor fabrications, batch processing devices (BPD) are mainly used for oxidation, diffusion, deposition and performance test operations. To optimize scheduling solutions of non-identical semiconductor BPDs where existing multi-products and different due dates, a heuristic scheduling method based on Particle swarm optimization (PSO) and weighted cost rate (WCR) is proposed for minimizing the objective of the earliness/tardiness(E/T) penalties. The two-level heuristic scheduling algorithm is developed. Experiment results indicate that the proposed algorithm is valid and practical. Compared with the previous heuristic scheduling algorithms, it is more efficient in improving the weighted earliness/tardiness performance.

Weighted Cost Rate-Based Heuristic Scheduling Method for Semiconductor Furnaces

2010 ◽  
Vol 44-47 ◽  
pp. 2186-2190
Author(s):  
Zhi Qiang Lu ◽  
Bing Hai Zhou
Keyword(s):  
Dynamic Scheduling ◽  
Scheduling Algorithm ◽  
Due Dates ◽  
Semiconductor Wafer ◽  
Cost Rate ◽  
Heuristic Scheduling ◽  
Scheduling Method ◽  
Waiting Cost ◽  
Objective Value ◽  
Wafer Manufacturing

In semiconductor wafer manufacturing, furnaces are mainly used for diffusion and deposition operations. During operations, wherever a furnace becomes available, scheduling the next batch deals with decisions on a batch which operation to process next and how many wafer lots to group the batch. To resolve the mentioned scheduling problem of the furnace where existing multi-products and different due dates, a heuristic dynamic scheduling algorithm called WCRHA (weighted cost rate heuristic algorithm) is presented to minimize the objective value of the waiting cost per unit time based on due date constraints. Simulation results show that the proposed algorithm is valid and feasible. Compared with the previous dynamic scheduling algorithms, it is more efficient in ensuring delivery and reducing completion time.

Scheduling of Multiple Projects with Resource Constraints Using Genetic Algorithms

2008 ◽  
Vol 392-394 ◽  
pp. 755-760
Author(s):  
Li Hong Qiao ◽  
C. Wang
Keyword(s):  
Genetic Algorithms ◽  
Resource Constraints ◽  
Search Space ◽  
Initial Population ◽  
Heuristic Scheduling ◽  
Population Selection ◽  
Scheduling Method ◽  
Period Performance ◽  
Crossover Method

A scheduling approach using genetic algorithms (GA) was presented to optimize multiple projects for quality project period performance with resource constraints. The model of the approach and key parameters of the algorithm including chromosome encoding and decoding, fitness computation, initial population, selection and crossover were conducted. A precedence feasible list was used in the chromosome encoding and decoding operation to reduce search space. An efficient crossover method was developed to avoid the procedure of chromosome recovery. A comparison was made between the algorithm and a heuristic scheduling method with an example. The result validates the superiority of the approach.

Sign in / Sign up

Export Citation Format

Share Document