1. Identity statement | |
Reference Type | Journal Article |
Site | mtc-m16c.sid.inpe.br |
Holder Code | isadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S |
Identifier | 8JMKD3MGP8W/346K3EB |
Repository | sid.inpe.br/mtc-m18@80/2008/11.04.17.09 (restricted access) |
Last Update | 2008:11.04.17.09.07 (UTC) administrator |
Metadata Repository | sid.inpe.br/mtc-m18@80/2008/11.04.17.09.09 |
Metadata Last Update | 2018:06.04.04.05.43 (UTC) administrator |
Secondary Key | INPE--PRE/ |
DOI | 10.1016/j.cie.2007.11.018 |
ISSN | 0360-8352 |
Citation Key | NaganoRuizLore:2008:CoGeAl |
Title | A Constructive Genetic Algorithm for permutation flowshop scheduling |
Year | 2008 |
Month | Aug. |
Access Date | 2024, Apr. 28 |
Secondary Type | PRE PI |
Number of Files | 1 |
Size | 325 KiB |
|
2. Context | |
Author | 1 Nagano, Marcelo Seido 2 Ruiz, Rubem 3 Lorena, Luiz Antonio Nogueira |
Resume Identifier | 1 2 3 8JMKD3MGP5W/3C9JHMQ |
Group | 1 2 3 LAC-CTE-INPE-MCT-BR |
Affiliation | 1 Universidade de São Paulo (USP) 2 Univ Politecn Valencia 3 Instituto Nacional de Pesquisas Espaciais (INPE) |
Journal | Computers and Industrial Engineering |
Volume | 55 |
Number | 1 |
Pages | 195-207 |
History (UTC) | 2008-11-19 17:38:00 :: simone -> administrator :: 2018-06-04 04:05:43 :: administrator -> marciana :: 2008 |
|
3. Content and structure | |
Is the master or a copy? | is the master |
Content Stage | completed |
Transferable | 1 |
Content Type | External Contribution |
Keywords | flowshop Constructive Genetic Algorithm makespan |
Abstract | The general flowshop scheduling problem is a production problem where a set of n jobs have to be processed with identical flow pattern on in machines. In permutation flowshops the sequence of jobs is the same on all machines. A significant research effort has been devoted for sequencing jobs in a flowshop minimizing the makespan. This paper describes the application of a Constructive Genetic Algorithm (CGA) to makespan minimization on flowshop scheduling. The CGA was proposed recently as an alternative to traditional GA approaches, particularly, for evaluating schemata directly. The population initially formed only by schemata, evolves controlled by recombination to a population of well-adapted structures (schemata instantiation). The CGA implemented is based on the NEH classic heuristic and a local search heuristic used to define the fitness functions. The parameters of the CGA are calibrated using a Design of Experiments (DOE) approach. The computational results are compared against some other successful algorithms from the literature on Taillard's well-known standard benchmark. The computational experience shows that this innovative CGA approach provides competitive results for flowshop scheduling; problems. |
Area | COMP |
Arrangement | urlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > A Constructive Genetic... |
doc Directory Content | access |
source Directory Content | there are no files |
agreement Directory Content | there are no files |
|
4. Conditions of access and use | |
Language | en |
Target File | a constructive.pdf |
User Group | administrator simone |
Visibility | shown |
Archiving Policy | denypublisher denyfinaldraft36 |
Read Permission | deny from all and allow from 150.163 |
|
5. Allied materials | |
Next Higher Units | 8JMKD3MGPCW/3ESGTTP |
Dissemination | WEBSCI; PORTALCAPES. |
Host Collection | sid.inpe.br/mtc-m18@80/2008/03.17.15.17 |
|
6. Notes | |
Empty Fields | alternatejournal archivist callnumber copyholder copyright creatorhistory descriptionlevel documentstage e-mailaddress electronicmailaddress format isbn label lineage mark mirrorrepository nextedition notes orcid parameterlist parentrepositories previousedition previouslowerunit progress project readergroup rightsholder schedulinginformation secondarydate secondarymark session shorttitle sponsor subject tertiarymark tertiarytype typeofwork url versiontype |
|
7. Description control | |
e-Mail (login) | marciana |
update | |
|