Search academic resources

The problem of multiprogram scheduling on a single processor is studied from the viewpoint of the characteristics peculiar to the program functions that need guaranteed service. It is shown that an optimum fixed priority...

Subjects / keywords: Economía y Comercio; Economía; General

Subjects / keywords: Ciencia; Investigación y Metodología

Subjects / keywords: JOHNSON, LYNWOOD A; JOHN WILEY & SONS; 658.503 J67o

Subjects / keywords: KERZNER, HAROLD; JOHN WILEY & SONS; 658.404 K419p9

Subjects / keywords: KERZNER, HAROLD; JOHN WILEY & SONS; 658.404 K419p7

Industrial planning has experienced notable advancements since its beginning by the middle of the 20th century. The importance of its application within the several industries where it is used has been demonstrated, rega...

Identical parallel machines problems (Pm) involve task assignments to the system's resources (a machine bank in parallel). The basic model consists of m machines and n tasks. The tasks are assigned according to the avail...

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...

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...

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...