Parallel and sequential evolutionary algorithms for the flow shop scheduling problem
Determining an optimal schedule to m1mm1ze the completion time of the last job abandoning the system (makespan) become a very difficult problem when there are more than two machines in the flow shop. Due both to its economical impact and complexity attention to solve the Flow Shop Scheduling problem...
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2000
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/23411 |
| Aporte de: |
| id |
I19-R120-10915-23411 |
|---|---|
| record_format |
dspace |
| institution |
Universidad Nacional de La Plata |
| institution_str |
I-19 |
| repository_str |
R-120 |
| collection |
SEDICI (UNLP) |
| language |
Inglés |
| topic |
Ciencias Informáticas Multiple Crossovers per Couple (MCPC) Flow Shop Scheduling problem (FSSP) island model Scheduling Algorithms |
| spellingShingle |
Ciencias Informáticas Multiple Crossovers per Couple (MCPC) Flow Shop Scheduling problem (FSSP) island model Scheduling Algorithms Esquivel, Susana Cecilia Printista, Alicia Marcela Zuppa, Federico Gallard, Raúl Hector Parallel and sequential evolutionary algorithms for the flow shop scheduling problem |
| topic_facet |
Ciencias Informáticas Multiple Crossovers per Couple (MCPC) Flow Shop Scheduling problem (FSSP) island model Scheduling Algorithms |
| description |
Determining an optimal schedule to m1mm1ze the completion time of the last job abandoning the system (makespan) become a very difficult problem when there are more than two machines in the flow shop. Due both to its economical impact and complexity attention to solve the Flow Shop Scheduling problem (FSSP) has been paid by many researchers. Current trends involve distinct evolutionary computation approaches. Parallel implementations of Evolutionary Algorithms aim to improvements on performance.
This work shows an implementation of parallel and sequential evolutionary approaches for the FSSP. The first one implements the island model on diverse number of island while the second evolves a single population. Experiments include also latest approaches using a multiplicity feature: Multiple Crossovers per Couple (MCPC) on a set of flow shop scheduling instances. A discussion on implementation details, analysis and comparisons of sequential, parallel, single and multirecombinated evolutionary approaches to the problem are shown. |
| format |
Objeto de conferencia Objeto de conferencia |
| author |
Esquivel, Susana Cecilia Printista, Alicia Marcela Zuppa, Federico Gallard, Raúl Hector |
| author_facet |
Esquivel, Susana Cecilia Printista, Alicia Marcela Zuppa, Federico Gallard, Raúl Hector |
| author_sort |
Esquivel, Susana Cecilia |
| title |
Parallel and sequential evolutionary algorithms for the flow shop scheduling problem |
| title_short |
Parallel and sequential evolutionary algorithms for the flow shop scheduling problem |
| title_full |
Parallel and sequential evolutionary algorithms for the flow shop scheduling problem |
| title_fullStr |
Parallel and sequential evolutionary algorithms for the flow shop scheduling problem |
| title_full_unstemmed |
Parallel and sequential evolutionary algorithms for the flow shop scheduling problem |
| title_sort |
parallel and sequential evolutionary algorithms for the flow shop scheduling problem |
| publishDate |
2000 |
| url |
http://sedici.unlp.edu.ar/handle/10915/23411 |
| work_keys_str_mv |
AT esquivelsusanacecilia parallelandsequentialevolutionaryalgorithmsfortheflowshopschedulingproblem AT printistaaliciamarcela parallelandsequentialevolutionaryalgorithmsfortheflowshopschedulingproblem AT zuppafederico parallelandsequentialevolutionaryalgorithmsfortheflowshopschedulingproblem AT gallardraulhector parallelandsequentialevolutionaryalgorithmsfortheflowshopschedulingproblem |
| bdutipo_str |
Repositorios |
| _version_ |
1764820465893769218 |