[PDF] Top 20 Scheduling Tasks to Minimize the Total Computation and Communication Makespan
Has 10000 "Scheduling Tasks to Minimize the Total Computation and Communication Makespan" found on our website. Below are the top 20 most common "Scheduling Tasks to Minimize the Total Computation and Communication Makespan".
Scheduling Tasks to Minimize the Total Computation and Communication Makespan
... the communication times of all the data for the tasks assigned to the out-channels is balanced as much as ...of scheduling independent jobs on identical machines (which is the same as the ... See full document
14
An Efficient Dual Objective Grid Workflow Scheduling Algorithm
... efficient scheduling algorithms are fundamentally ...Task scheduling is a fundamental issue in achieving high performance in grid computing ...general scheduling problem is NP-Complete [1]. The grid ... See full document
6
Efficient Heuristic to Minimize Makespan in Single Machine Scheduling Problem with Unrelated Parallel Machines
... of scheduling jobs on the unrelated paral- lel machines to minimize the makespan and reported that genetic algorithm gives poor ...the makespan of independent tasks assigned on the ... See full document
11
Scheduling a maintenance activity under skills constraints to minimize total weighted tardiness and late tasks Pages 135-144 Download PDF
... concerns scheduling of maintenance tasks under resource (maintenance teams) ...minimizing total weighted tardiness (TWT) and number of tardiness ...maintenance scheduling problem (with unequal ... See full document
10
Using a Modified Simulated Annealing Algorithm to Minimize Makespan in a Permutation Flow-shop Scheduling Problem with Job Deterioration
... of scheduling n deteriorating jobs on m identical parallel machines to minimize the ...machine scheduling problem in which the objective is to minimize the total completion ... See full document
6
Joint computation and communication design for UAV-assisted mobile edge computing in IoT
... latency-critical computation task in each time slot to complete. Three computation strategies can be available to each ...to minimize the total energy consumption including ... See full document
10
AN EMPIRICAL EVALUATION FOR THE INTRUSION DETECTION FEATURES BASED ON MACHINE LEARNING AND FEATURE SELECTION METHODS
... processor communication can be reduced by using task duplication ...Some tasks are duplicated on multiple machines to adjust the data locally, and some techniques use the task duplication concept for ... See full document
11
Scheduling partially ordered jobs faster than 2n
... the total amount of time that this job waited to be finished; formally, the completion time of a job v is defined as the sum of processing times of v and all jobs scheduled ...to minimize the total ... See full document
25
An Iterative Random PSO to minimize Total-flowtime in Flowshop Scheduling
... Flowshop scheduling is an interdisciplinary challenge of addressing major optimality criteria of minimizing makespan and ...achieves total-flow-time objective of flowshop ...the total- ... See full document
5
A heuristic algorithm for scheduling in a flow shop environment to minimize makespan Pages 173-184 Download PDF
... to minimize the makespan, total waiting time and total tardiness in a flow shop consisting of n jobs and m ...shop scheduling problem with setup and assembly ...shop scheduling ... See full document
12
A new mathematical model for single machine batch scheduling problem for minimizing maximum lateness with deteriorating jobs Pages 253-264 Download PDF
... deterioration scheduling problem in which the processing time of a job was a function of its starting ...machine scheduling problem considered this problem to minimize the makespan, ... See full document
12
Workflow Scheduling Using Hybrid Discrete Particle Swarm Optimization (HDPSO) In Cloud Computing Environment
... The tasks in these workflows require lot of computation power and communication between ...workflow tasks to resources is an NP-hard problem, workflow scheduling is quite challenging in ... See full document
7
Tabu search method for solving multiobjective job shop scheduling problem
... activities, tasks and production over time. The application of scheduling can be seen on scheduling of jobs in factories and companies and also scheduling employee work hours (Pedersen, ... See full document
28
A hybrid chemical reaction optimization scheme for task scheduling on heterogeneous computing systems
... of tasks can be rep- resented by a node- and edge-weighted directed acyclic graph (DAG), in which the vertices represent the computations and the directed edges represent the data dependencies as well as the ... See full document
15
5. Optimizing a multi-objectives flow shop scheduling problem by a novel genetic algorithm Pages 345-354 Download PDF
... flowshop scheduling problem, where the primary criterion was minimization of total flow ...the makespan in a flow shop scheduling problem with multiple processors and no intermediate ... See full document
10
Design and Comparison of Simulated Annealing Algorithm and GRASP to Minimize Makespan in Single Machine Scheduling with Unrelated Parallel Machines
... of scheduling jobs on unrelated parallel machines to minimize the makespan and reported that genetic algorithm gives poor ...to minimize the makespan of scheduling n independent ... See full document
11
Workflow Scheduling in Mapreduce Environment by Local and Global Metaheaurstic
... appointed tasks to nodes whereas not connection the attainable of the ...programing tasks on nodes supported optimally matching job requirements to node ...of tasks to ... See full document
6
MODELING AND SIMULATION OF GRID CONNECTED PHOTOVOLTAIC DISTRIBUTED GENERATION SYSTEM
... non-periodic communication tasks) is proposed in this ...optimizes communication window debris. Compared with typical scheduling strategy of application layer in industrial control network, ... See full document
5
Makespan Algorithms and Heuristic for Internet Based Collaborative Manufacturing Process Using Bottleneck Approach
... presents makespan algorithms and scheduling heuristic for an Internet-based collaborative design and manufacturing process using bottleneck ...effective makespan algorithms and constructive heuristic ... See full document
7
(T max ). The problems with those objective functions are proven
... In this research, we preferred to apply the first way which is an optimization of the linear combination of two measurements which are makespan and tardiness. To do so; we implemented a genetic algorithm. In ... See full document
5
Related subjects