Cerca risorse accademiche

Over the past few years, a continually increasing number of research efforts have investigated the application of evolutionary computation techniques for the solution of scheduling problems. Scheduling problems can pose...

In scheduling, a set of machines in parallel is a setting that is important, from both the theoretical and practical points of view. From the theoretical viewpoint, it is a generalization of the single machine scheduling...

A variety of optimization problems in fields such as production operations in manufacturing industry, parallel and distributed systems, logistics and traffic can be summarized within the general class of scheduling probl...

Allocation of the components (tasks) of a parallel program to processors in a multiprocessor or a multicomputer system take full advantage of the computational power provided by the system. Evolutionary approaches has b...

This paper presents an extension of the Latency Time (LT) scheduling algorithm for assigning tasks with arbitrary execution times on a multiprocessor with shared memory. The Extended Latency Time (ELT) algorithm adds to ...

This article introduces a new version of the Multiple Machine Scheduling Problem: the Scheduling Problem with Time Windows and Minimal Overlap (SPTWMO). Given a set of nonpreemptive jobs with time windows and a number of...

In this preliminary study the Flow Shop Scheduling Problem (FSSP) is solved by hybrid Evolutionary Algorithms. The algorithms are obtained as a combination of an evolutionary algorithm, which uses the Multi-Inver-Over op...

This paper is an extension of a previous paper published in [2]. In this problem it is necessary to schedule several jobs that involve four process and for each one of them there is a group of machines available (of simi...

In a production system it is usual to stress minimum tardiness to achieve higher client satisfaction. According to the client relevance, job processing costs and requirements, and various other considerations, a weight ...

En los últimos años ha surgido un gran interés en las metaheurísticas híbridas, las cuales han sido desarrolladas considerablemente en el campo de la optimización. Combinaciones de algoritmos han provisto técnicas...

The parallel machines scheduling problem (Pm) comprises the allocation of jobs on the system’s resources, i.e., a group of machines in parallel. The basic model consists of m identical machines and n jobs. The jobs are...

This paper includes part of the strategies used to solve a scheduling problem developed for a company that produces flexible packaging, presented in a quite general form though. In this problem it is necessary to schedul...

This paper includes part of the strategies used to solve a scheduling problem developed for a company that produces flexible packaging, presented in quite a general form though. In this problem it is necessary to schedul...

Evolutionary algorithms (EAs) can be used as optimisation mechanisms. Based on the model of natural evolution, they work on populations of individuals instead of on single solutions. In this way, the search is performed ...

This paper shows an algorithm to deal with a scheduling problem that requires to deal with conditions related to the selections of activities and preferences for the selection of resources. The scheduling problem could ...

A parallel program, when running, can be conceived a set of parallel components (tasks) which can be executed according to sorne precedence relationship. In this case efficient scheduling of tasks permits to take full.a...

Instances of static scheduling problems can be easily represented as graphs where each node represents a particular operation. This property makes the Ant Colony Algorithms well suited for different kinds of scheduling p...

Este trabajo describe un estudio de distintas soluciones al problema del job shop scheduling basado en algoritmos genéticos. La característica fundamental es la utilización de decodificadores incorporada a la represen...

We present the results of our work on applying genetic algorithms combined with a discrete event simulation to the problem of convoy scheduling. We show that this approach can automatically remove conflicts from a convoy...

In Bluetooth networks, devices are organized into small piconets and large scatternets, and each node acts as the role of master, slave or gateway. Due to dynamic topology changes, different bandwidth available and unpre...

In this work, we present an integral scheduling system for non-dedicated clusters, termed CISNE-P, which ensures the performance required by the local applications, while simultaneously allocating cluster resources to pa...

In this work, we present an integral scheduling system for non-dedicated clusters, termed CISNE-P, which ensures the performance required by the local applications, while simultaneously allocating cluster resources to pa...

In this paper we present a comparative study of four trajectory metaheuristics or single-solution based metaheuristics (S-meta heuristics): Iterated Local Search (ILS), Greedy Randomized Adaptive Search Procedure (GRASP)...

Many researchers have shown interest to solve the job shop scheduling problem (JSSP) applying evolutionary algorithms (EAs). In a previous work we reported an enhanced evolutionary algorithm, which uses a multiplicity fe...