Search academic resources

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

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

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

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

Over the past three decades extensive search have been done on pure m-machine flow shop problems. Many researchers faced the Flow Shop Scheduling Problem (FSSP) by means of well-known heuristics which, are successfully ...

The study of earliness and tardiness penalties in scheduling is a relatively recent area of research. In the past, traditionally the emphasis was put on regular measures that are nondecreasing in job completion times suc...

The problem of how to find a schedule on m > 2 processors of equal capacity that minimises the whole processing time of independent tasks has been shown as belonging to the NP-complete class (Horowitz and Sahni [12]). Ev...

Evolutionary algorithms (EAs) have been successfully applied to scheduling problems. Current improvements towards convergence issues in EAs include incest prevention and multiplicity features. A multiplicity feature all...

A new issue for combinatorial optimization problems is to incorporate local search into the framework of evolutionary algorithms, leading to hybrid evolutionary algorithms. With the hybrid approach, evolutionary algorith...

A job shop can be seen as a multi-operation model where jobs follows fixed routes, but not necessarily the same for each job. Job Shop Scheduling (JSS) attempts to provide optimal schedules according to some criterion. C...

Improvements in evolutionary algorithms (EAs) consider multirecombination, allowing multiple crossover operations on a pair of parents (MCPC, multiple crossovers per couple) or on a set of multiple parents (MCMP, multipl...

Este artículo presenta un estudio comparativo de los resultados obtenidos a partir de la aplicación de Algoritmos Genéticos (AGs) a un caso particular del problema Job-Shop Scheduling (JSS). El objetivo del estudio es...

The flow shop scheduling problem (FSSP) [12], has held the attention of many researchers. In a simplest usual situation, a set of jobs must follow the same route to be executed on a set of machines (resources) and the ma...

Scheduling is an active area of research in applied artificial intelligence. Scheduling problems typically comprise several concurrent (and often conflicting) goals, and several resources which may be allocated in order ...

Jobs to be delivered in a production system are usually weighted according to clients requirements and relevance. Attempting to achieve higher customer satisfaction trends in manufacturing are focussed today on productio...

This work summarizes results when facing the problem of allocating a number of nonidentical tasks in a parallel system. The model assumes that the system consists of a number of identical processors and that only one tas...

Process flow scheduling is a concept that refers to the scheduling of flow shop process plants, whose scheduling calculations are guided by the process structure. In a wide variety of high-volume process industries, the ...

In previous works the ability of CPS-MCPC (an evolutionary, co-operative, population search method with multiple crossovers per couple) to build well delineated Pareto fronts in diverse multiobjective optimization proble...

Evolutionary algorithms (EAs) offer a robust approach to problem solving. EAs are extremely flexible and can be extended by incorporating alternative approaches to favour he search process. One way is to hybridize an evo...

Este artigo propõe recursos para o escalonamento de objetos distribuídos. Para tanto, são definidos dois mecanismos tidos como centrais para tal: um primeiro que irá realizar a instanciação remota de objetos Java, ...