• No se han encontrado resultados

[PDF] Top 20 Different evolutionary approaches to solve the flow shop scheduling problem

Has 10000 "Different evolutionary approaches to solve the flow shop scheduling problem" found on our website. Below are the top 20 most common "Different evolutionary approaches to solve the flow shop scheduling problem".

Different evolutionary approaches to solve the flow shop scheduling problem

Different evolutionary approaches to solve the flow shop scheduling problem

... Over the past three decades extensive search have been done on pure m-machine flow shop ...faced the Flow Shop Scheduling Problem (FSSP) by means of well-known ... See full document

3

A study of genotype and phenotype distributions in hybrid evolutionary algorithms to solve the flow shop scheduling problem

A study of genotype and phenotype distributions in hybrid evolutionary algorithms to solve the flow shop scheduling problem

... In the last instance (Tail044, ...us to describe the job allocation in relation with their ...of the hybrid algorithms used to solve the ...that the ... See full document

10

An Efficient Iterated Greedy Algorithm for the Makespan Blocking Flow Shop Scheduling Problem

An Efficient Iterated Greedy Algorithm for the Makespan Blocking Flow Shop Scheduling Problem

... methods to meta-heuristic ones. Some of the most important techniques are briefly presented in the ...Solving the BFSP using exact methods has attracted few attention in comparison with other ... See full document

5

Solving the flow shop scheduling problem under evolutionary approaches

Solving the flow shop scheduling problem under evolutionary approaches

... of the flow-shop problem is essentially a permutation schedule problem, a permutation can be used as the representation scheme of chromosomes, which is the natural one for ... See full document

3

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] ... See full document

12

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] ... See full document

11

Facing the job shop scheduling problem wih hybrid evolutionary algorithms

Facing the job shop scheduling problem wih hybrid evolutionary algorithms

... ✹✬✺✼✻✜✻✾✽✸✿✦❀ Evolutionary algorithms (EAs) offer a robust approach to problem ...alternative approaches to favour he search process. One way is to hybridize an ... See full document

3

Evolutionary approaches for the parallel task scheduling problem : the representation issue

Evolutionary approaches for the parallel task scheduling problem : the representation issue

... HEURISTICS TO FACE TASK SCHEDULING PROBLEMS The task allocation problem has been investigated by many researchers [3], [4], [8], [9], [10], [13], ...From the repre- sentation ... See full document

10

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

... 1 to 4 show the evolution over the generations of both the best individual (lower curves) and the mean population makespan (higher ...represents the number of generations and ... See full document

9

Incest prevention and multicore combinated evolutionary algorithms for the job shop scheduling problem

Incest prevention and multicore combinated evolutionary algorithms for the job shop scheduling problem

... In scheduling the main difficulty encountered is to specify an appropriate representation of feasible schedules (the solution of JSSP) ...[3]. The representations can be direct or ... See full document

3

Multiobjective evolutionary algorithms for job shop scheduling

Multiobjective evolutionary algorithms for job shop scheduling

... aggregative approaches those methods where a single objective function resulting as a nu- merical combination of objectives values is to be ...search the space for a set of slightly “good” solutions ... See full document

3

Non-Traditional Flow Shop Scheduling Using CSP

Non-Traditional Flow Shop Scheduling Using CSP

... failing to consider non-traditional requirements, orders meeting future demand would be manufactured too early, thus generating a cost for maintaining inventory, and, as a worst case scenario, it would cause a ... See full document

9

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

... Contrasting the different selection methods, the values achieved showed a better performance for both SUS and Proportional Selection over other methods, without a clear conclusion on which one ... See full document

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] ... See full document

5

Evolutionary algorithms to solve the school timetabling problem

Evolutionary algorithms to solve the school timetabling problem

... Página 442 Workshop de Investigadores en Ciencias de la Computación WICC 2002.. Página 443 Workshop de Investigadores en Ciencias de la Computación WICC 2002.[r] ... See full document

4

Hybrid evolutionary algorithms to solve scheduling problems

Hybrid evolutionary algorithms to solve scheduling problems

... Página 454 Workshop de Investigadores en Ciencias de la Computación WICC 2002.. Página 455 Workshop de Investigadores en Ciencias de la Computación WICC 2002[r] ... See full document

3

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

... and scheduling strategy that analyzes every possible combination is computationally expensive and it only works for some kinds (sizes) of ...on the other hand, do try to solve the most ... See full document

10

Multirecombining random and seed immigrants in evolutionary algorithms to face the shop scheduling problem

Multirecombining random and seed immigrants in evolutionary algorithms to face the shop scheduling problem

... Página 475 Workshop de Investigadores en Ciencias de la Computación WICC 2002. Página 476 Workshop de Investigadores en Ciencias de la Computación WICC 2002[r] ... See full document

5

An evolutionary approach to the parallel task scheduling problem

An evolutionary approach to the parallel task scheduling problem

... As wc are interested in scheduling of arbitrary tasks graph:s onto i.l reasonable number of processors we would be content with polynomial time schcduling algorithms[r] ... See full document

6

Approaches based on complexity are inadequate to solve the mind-body problem

Approaches based on complexity are inadequate to solve the mind-body problem

... in the case of Bernard cells and B-Z chemical waves, two classical examples used in discussions concerning com- plexity and the emergence of order) does not imply self-causation, at least in the way ... See full document

8

Show all 10000 documents...