Displaying similar documents to “Analysis of an approximation algorithm for scheduling indepentent parallel tasks.”

Analysis of the best-worst ant system and its variants on the TSP.

Oscar Cordón, Iñaki Fernández de Viana, Francisco Herrera (2002)

Mathware and Soft Computing

Similarity:

In this contribution, we will study the influence of the three main components of Best-Worst Ant System: the best-worst pheromone trail update rule, the pheromone trail mutation and the restart. Both the importance of each of them and the fact whether all of them are necessary will be analyzed. The performance of different variants of this algorithm will be tested when solving different instances of the TSP.

An improved ant algorithm for Multi-mode Resource Constrained Project Scheduling Problem

Peng Wuliang, Huang Min, Hao Yongping (2014)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

Many real-world scheduling problems can be modeled as Multi-mode Resource Constrained Project Scheduling Problems (MRCPSP). However, the MRCPSP is a strong NP-hard problem and very difficult to be solved. The purpose of this research is to investigate a more efficient alternative based on ant algorithm to solve MRCPSP. To enhance the generality along with efficiency of the algorithm, the rule pool is designed to manage numerous priority rules for MRCPSP. Each ant is provided with an...

A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints

Lixin Miao, Qingfang Ruan, Kevin Woghiren, Qi Ruo (2012)

RAIRO - Operations Research

Similarity:

This paper addresses a Three-Dimensional Loading Capacitated Vehicle Routing Problem (3L-CVRP) which combines a three-dimensional loading problem and vehicle routing problem in distribution logistics. The problem requires the combinatorial optimization of a feasible loading solution and a successive routing of vehicles to satisfy client demands, where all vehicles must start and terminate at a central depot. In spite of its clear practical...

A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints

Lixin Miao, Qingfang Ruan, Kevin Woghiren, Qi Ruo (2012)

RAIRO - Operations Research

Similarity:

This paper addresses a Three-Dimensional Loading Capacitated Vehicle Routing Problem (3L-CVRP) which combines a three-dimensional loading problem and vehicle routing problem in distribution logistics. The problem requires the combinatorial optimization of a feasible loading solution and a successive routing of vehicles to satisfy client demands, where all vehicles must start and terminate at a central depot. In spite of its clear practical...

Scheduling multiprocessor tasks on two parallel processors

Jacek Błażewicz, Paolo Dell'Olmo, Maciej Drozdowski (2002)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

In this work scheduling multiprocessor tasks on two parallel identical processors is considered. Multiprocessor tasks can be executed by more than one processor at the same moment of time. We analyze scheduling unit execution time and preemptable tasks to minimize schedule length and maximum lateness. Cases with ready times, due-dates and precedence constraints are discussed.