• No se han encontrado resultados

job shop scheduling problem

O uso do Mixed-Integer e Constraint Programming para a resolução do Job Shop Scheduling Problem

O uso do Mixed-Integer e Constraint Programming para a resolução do Job Shop Scheduling Problem

... do Job Shop Scheduling Problem (JSSP), sendo uma baseada em modelagens Mixed-Integer Programming (MIP) e outras duas resolvidas com base nos conceitos do Constraint Programming (CP), por meio ...

9

A Hybrid Simulated Annealing for Job Shop Scheduling Problem

A Hybrid Simulated Annealing for Job Shop Scheduling Problem

... The Job Shop Scheduling Problem (JSSP) arises in the context of high-performance computing and belongs to the NP-hard combinatorial optimization ...this problem is minimizing the ...

10

An improved ant colony algorithm for the job shop scheduling problem

An improved ant colony algorithm for the job shop scheduling problem

... So far, there exist a few applications of the ACO approach to scheduling problems. Dorigo et al. [10, 11] and Zwaan et al. [18] reported some promising results for the Job Shop Scheduling ...

11

An analysis on selection methods and multirecombination in evolutionary search when solving the job shop scheduling problem

An analysis on selection methods and multirecombination in evolutionary search when solving the job shop scheduling problem

... EAs considered in this work are improved with a multiplicity feature to solve the job shop scheduling problems (JSSP). The algorithm applied here, multiple crossovers on multiple parents (MCMP), ...

11

Incorporating tabu search for local search into evolutionary algorithms to solve the job shop scheduling problem

Incorporating tabu search for local search into evolutionary algorithms to solve the job shop scheduling problem

... 6XSSRVLQJ D -663 ZLWK MREV DQG PDFKLQHV D SRVVLEOH FKURPRVRPH XQGHU RSHUDWLRQ EDVHG UHSUHVHQWDWLRQ PLJKW EH [ > @ 1RZ VRPH HYDOXDWLRQ IXQFWLRQ WKDW SURYLGHV IHHGEDFN IRU WKH[r] ...

11

Perfomance evaluation of selection methods to solve the job shop scheduling problem

Perfomance evaluation of selection methods to solve the job shop scheduling problem

... Página 470 Workshop de Investigadores en Ciencias de la Computación WICC 2002. Página 471 Workshop de Investigadores en Ciencias de la Computación WICC 2002[r] ...

5

Contrasting two MCMP alternatives in evolutionary algorithms to solve the job shop scheduling problem

Contrasting two MCMP alternatives in evolutionary algorithms to solve the job shop scheduling problem

... ,Q D MRE VKRS UHSUHVHQWDWLRQ ZH GHDO ZLWK SHUPXWDWLRQV VR DGHTXDWH JHQHWLF RSHUDWRUV VXFK DV SDUWLDOO\PDSSHG FURVVRYHU 30; >@ RUGHU FURVVRYHU 2; >@ DQG F\FOH FURVVRYHU &; >@[r] ...

12

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

Metaheurística ACO en dos etapas aplicada al problema del Job Shop Scheduling

Metaheurística ACO en dos etapas aplicada al problema del Job Shop Scheduling

... the Job Shop Scheduling Problem ...original problem, these partial solutions serve as initial states for the search performed by the ants in the second ...

85

The role of different crossover methods when solving the open shop scheduling problem via a simple evolutionary approach

The role of different crossover methods when solving the open shop scheduling problem via a simple evolutionary approach

... repair shop [10]. In such a shop, a typical job might involve the operations “spray-paint”, and “change-tyres” to be performed on the same ...a job must be performed in some fixed order, then ...

9

Formulación y validación de una heurística paretiana para el problema de Scheduling Job-Shop multi-recurso con rutas lineales multi objetivo

Formulación y validación de una heurística paretiana para el problema de Scheduling Job-Shop multi-recurso con rutas lineales multi objetivo

... Para comprender el problema de la presente asistencia, se requiere inicialmente definir el problema clásico de scheduling Job-shopJob-shop Scheduling problem -JSP-”. JSP ...

45

Upgrading evolutionary algorithms through multiplicity for multiobjective optimization in job shop scheduling problems

Upgrading evolutionary algorithms through multiplicity for multiobjective optimization in job shop scheduling problems

... of scheduling problems [17] and their economical impact motivated extensive research [1], [2], [28], ...The job shop scheduling problem (JSSP) is related to the allocation of limited ...

12

Formulación y validación de una heurística para minimizar la tardanza total ponderada en el problema de scheduling Job-shop Multi-recurso con rutas lineales.

Formulación y validación de una heurística para minimizar la tardanza total ponderada en el problema de scheduling Job-shop Multi-recurso con rutas lineales.

... Para el entendimiento propiamente del problema que se atribuye a esta investigación, es importante dar conceptualización al problema peculiar que lo ha de anteceder, para esto se remite al scheduling ...

39

Formulación de heurística para minimizar la tardanza total ponderada en el problema de Scheduling job-shop flexible

Formulación de heurística para minimizar la tardanza total ponderada en el problema de Scheduling job-shop flexible

... de scheduling Job-Shop flexible “Flexible Job-Shop Scheduling Problem – FJSP “, es definido a partir de las consideraciones del problema clásico de Job-Shop ...

30

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

115

Un algoritmo genético para el problema de Job Shop Flexible

Un algoritmo genético para el problema de Job Shop Flexible

... Flexible Job Shop problem (found in Operations Management), which is part of the family of job or task scheduling problems in a shop that works on ...the Job Shop ...

9

Feature transformations for improving the performance of selection hyper heuristics on job shop scheduling problems

Feature transformations for improving the performance of selection hyper heuristics on job shop scheduling problems

... Another approach for finding solutions to the mathematical formulations previously presented has been the use of Lagrangian non-negative multipliers to relax constraints [60] such as precedence. Also, several ...

103

Show all 2222 documents...

Related subjects