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

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

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

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

El presente trabajo describe una propuesta de investigación para atacar diferentes problemas de scheduling. Dicha tarea es realizada por investigadores de distintas líneas del LIDIC, y en consecuencia, con técnicas di...

The choice of a search algorithm can play a vital role in the success of a scheduling application. Evolutionary algorithms (EAs) can be used to solve this kind of combinatorial optimization problems. Compared to conventi...

Determining an optimal schedule to minimize the completion time of the last job abandoning the system (makespan) becomes a very difficult problem when there are more than two machines in the flow shop. Due both to its ec...

In an m-machines n-jobs flow-shop sequencing problem each job consists of m operations and each operation requires a different machine, so n jobs have to be processed in the same sequence on m machines. The processing ti...

In evolutionary algorithms selection mechanisms aim to favour reproduction of better individuals imposing a direction on the search process. It does not create new individuals; instead it selects comparatively good indiv...

The Open Shop Scheduling Problem (OSSP) is one of the most interesting, complexes and not frequently approached scheduling problems. Due to its intractability with other techniques, in this work we present an evolutionar...

We present a scheme for efficiently administrating a set of distributed simulation servers which attend requests from a number of users. These can be either sequential or parallel simulation models, or random combination...

In static scheduling problems it is assumed that jobs are ready at zero time or before processing begins. In dynamic scheduling problems a job arrival can be given at any instant in the time interval between zero and a l...

The Flow Shop Scheduling Problem have been tackled using different techniques which goes from mathematical techniques like Branch and Bound to metaheuristics like evolutionary algorithms (EAs). Although in the real worl...

Evolutionary Computation (EC) have been applied to a great number of optimisation problems with some success, specially in fields such as production operations in manufacturing industry, parallel and distributed systems,...

Importance driven half-toning (IDH) presents a method for reduced resource rendering of gray scale images. This approach uses an image pyramid to distribute drawing primitives to different areas of the image based on an ...