• No se han encontrado resultados

unrestricted parallel identical machines scheduling problem

Comparative study of trajectory metaheuristics for the resolution of scheduling problem of unrestricted parallel identical machines

Comparative study of trajectory metaheuristics for the resolution of scheduling problem of unrestricted parallel identical machines

... the unrestricted parallel identical machines scheduling problems, we work with some that were used by previous works such as [2], [3] and ...the problem instances were built ...

10

Evolutionary optimization of due date based objectives in unrestricted identical parallel machine scheduling problems

Evolutionary optimization of due date based objectives in unrestricted identical parallel machine scheduling problems

... 5 parallel equal machines scheduling systems for the objectives described ...5 parallel equal machines scheduling problem with problems sizes of 40 and 100 jobs, ...

10

Solving unrestricted parallel machine scheduling problems via evolutionary algorithms

Solving unrestricted parallel machine scheduling problems via evolutionary algorithms

... the problem of allocating a number of non-identical independent tasks in a production ...of identical machines and only one task may execute on a machine at a ...

5

Parallel ant algorithms for the minimum tardy task problem

Parallel ant algorithms for the minimum tardy task problem

... Salesperson Problem, the Quadratic Assignment Problem, as well as the Job Shop Schedul- ing, Vehicle Routing, Graph Coloring and Telecommunication Network Problem ...Task Problem in the past ...

12

Solving the flow shop scheduling problem under evolutionary approaches

Solving the flow shop scheduling problem under evolutionary approaches

... The multi-recombinative approaches, MCPC and MCMP, applied to the Flow Shop Scheduling Problem were tested under different chromosome representation: permutations and decoders. All the evolutionary ...

3

Solving the single machine scheduling problem with sequence-dependent set-up times as a TSP via evolutionary algorithms

Solving the single machine scheduling problem with sequence-dependent set-up times as a TSP via evolutionary algorithms

... of multiple parents, expecting that exploitation and exploration of the problem space be adequately balanced [11]. Both multirecombinative approaches are part of a wider family of EAs: those including multiplicity ...

3

Identificación y análisis de métodos heurísticos basados en reglas de prioridad para la solución de problemas de programación de múltiples proyectos con recursos restringidos (RCMPSP)

Identificación y análisis de métodos heurísticos basados en reglas de prioridad para la solución de problemas de programación de múltiples proyectos con recursos restringidos (RCMPSP)

... El problema de secuenciación de proyectos con recursos restringidos o RCPSP (Resource Constrained Project Scheduling Problem) es ampliamente tratado en la literatura y hace[r] ...

162

Parallel ant system applied to the multiple knapsack problem

Parallel ant system applied to the multiple knapsack problem

... a parallel implementation and consequently, an additional improvement on the response time can be ...single problem. The overall problem is split into parts, each of which is operated by a separate ...

11

Problemas de Scheduling: heurísticas para el Job Shop

Problemas de Scheduling: heurísticas para el Job Shop

... de Scheduling y sus métodos de ...de Scheduling y se realiza una descripción detallada del Job Shop Scheduling ...de Scheduling como el Recocido Simulado y SB así como operadores de transición ...

115

Algorithm creation and optimization for the crew pairing problem

Algorithm creation and optimization for the crew pairing problem

... La división de un problema complejo o NP-hard en subproblemas de menor dificultad es una técnica que se usa mucho, tal y como lo realizan Moudani et al. (2000), que resuelven imprevistos que llevan a la modificación de ...

44

A survey on financial applications of metaheuristics

A survey on financial applications of metaheuristics

... Options are derivative instruments of investment that are used for speculative or hedging activities in financial markets. An option derives its value according to their underlying asset values. Understanding the future ...

24

An Improved Hybrid Model for the Generic Hoist Scheduling Problem

An Improved Hybrid Model for the Generic Hoist Scheduling Problem

... hoist scheduling problem is NP-hard and arises from auto- mated manufacturing ...the problem description and solution method ...of problem classes on benchmark problems from several ...

22

Multiobjetive optimization co-evolution for the job shop scheduling problem

Multiobjetive optimization co-evolution for the job shop scheduling problem

... This presentation will show the design, implementations and results of a co-evolutive approaeh solving a multiobjeetive optimization problem involving the makespan, maehine [r] ...

5

Flexible scheduling for non-deterministic, and-parallel execution of logic programs

Flexible scheduling for non-deterministic, and-parallel execution of logic programs

... For concreteness (and also because our expenments were performed on it), we shall discuss the scheme as implemented in the dependent and-parallel system DASWAM [5], which has many simi[r] ...

5

Análisis de los métodos heurísticos de resolución del problema de programación de proyectos con recursos limitados (RCPSP: Resource Constrained Project Scheduling Problem)

Análisis de los métodos heurísticos de resolución del problema de programación de proyectos con recursos limitados (RCPSP: Resource Constrained Project Scheduling Problem)

... ABSTRACT: For the the success of the project planning it is essential that the allocation and resource leveling is performed in a accurate way, especially when resources are not infinite. This issue is addressed by the ...

21

Scheduling strategies for parallel patterns on heterogeneous architectures

Scheduling strategies for parallel patterns on heterogeneous architectures

... objects. Figure 2.14 shows an usage example of the TBB’s pipeline construct. As in any threading library, the first step is to initialise the library with the number of threads (in line 3). However, this initialisation ...

236

Deterministic and Stochastic Profit Maximization Versions of the Economic Lot Scheduling Problem with Pricing Considerations Edición Única

Deterministic and Stochastic Profit Maximization Versions of the Economic Lot Scheduling Problem with Pricing Considerations Edición Única

... supplier-buyer problem from the supplier’s point of view considering a scheme of quantity discounts is presented by Rosenblatt and Lee ...the problem of joint price and lot size determination faced by a ...

159

A GRASP algorithm to solve the problem of dependent tasks scheduling in different machines

A GRASP algorithm to solve the problem of dependent tasks scheduling in different machines

... task scheduling. It is possible to define task scheduling as: ...M machines, which can execute those tasks, where the goal is to find an execution order that minimizes the accumulated execution time, ...

10

Show all 2048 documents...

Related subjects