@article{
 title = {Mathematical models and heuristic methods for the assembly line balancing problem with hierarchical worker assignment},
 type = {article},
 year = {2021},
 pages = {1-19},
 websites = {https://www.tandfonline.com/doi/abs/10.1080/00207543.2021.1884767},
 id = {f2e17fd5-fa6a-3e9b-8c8a-3802ffbd6b43},
 created = {2021-04-20T19:56:41.698Z},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2021-04-20T19:56:41.698Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 citation_key = {Campana.EtAl/2021},
 private_publication = {false},
 bibtype = {article},
 author = {Campana, Nícolas Porto and Iori, Manuel and Moreira, Mayron César de Oliveira},
 journal = {International Journal of Production Research}
}

@inproceedings{
 title = {Solution of a Practical Pallet Building Problem with Visibility and Contiguity Constraints},
 type = {inproceedings},
 year = {2020},
 pages = {327-338},
 websites = {https://www.scitepress.org/Papers/2020/93517/93517.pdf},
 month = {5},
 publisher = {Scitepress},
 day = {18},
 city = {Prague},
 id = {124616b2-3649-3438-a464-0cea1378a107},
 created = {2020-06-28T20:45:53.663Z},
 file_attached = {true},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2021-04-20T14:46:39.899Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {false},
 hidden = {false},
 citation_key = {Iori.EtAl/2020icores},
 private_publication = {false},
 bibtype = {inproceedings},
 author = {Iori, Manuel and Locatelli, Marco and Moreira, M. C. O. and Silveira, Tiago},
 doi = {10.5220/0009351703270338},
 booktitle = {22nd International Conference on Enterprise Information Systems}
}

@inproceedings{
 title = {On solving the time window assignment vehicle routing problem via iterated local search},
 type = {inproceedings},
 year = {2020},
 pages = {1-12},
 websites = {https://link.springer.com/book/10.1007%2F978-3-030-63072-0},
 city = {Ischia},
 id = {cdd9d069-4185-32b3-8ee6-c96a48061fe5},
 created = {2020-06-28T20:50:02.724Z},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2021-04-20T14:46:40.106Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {false},
 hidden = {false},
 citation_key = {Burahem.EtAl/2020},
 private_publication = {false},
 bibtype = {inproceedings},
 author = {Martins, L. B. and Iori, M. and Moreira, M. C. O. and Zucchi, G.},
 booktitle = {18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization}
}

@inproceedings{
 title = {A hybrid heuristic for districting problems with routing criteria},
 type = {inproceedings},
 year = {2020},
 pages = {1-8},
 websites = {https://ieeexplore.ieee.org/document/9185863},
 city = {Glasgow},
 id = {5ccadc82-d265-3017-a9dd-e53dec6c989e},
 created = {2020-06-28T20:52:14.960Z},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2021-04-20T14:46:39.788Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {false},
 hidden = {false},
 citation_key = {Gliesh.EtAl/2020routing},
 private_publication = {false},
 bibtype = {inproceedings},
 author = {Gliesch, A. and Ritt, M. and Cruz, A. H. S. and Moreira, M. C. O.},
 booktitle = {Annals of IEEE WORLD CONGRESS ON COMPUTATIONAL INTELLIGENCE (WCCI) 2020}
}

@inproceedings{
 title = {A heuristic algorithm for districting problems with similarity constraints},
 type = {inproceedings},
 year = {2020},
 pages = {1-8},
 websites = {https://ieeexplore.ieee.org/document/9185552},
 city = {Glasgow},
 id = {62ad6e3a-25ea-30ea-a74e-b5e8017d7413},
 created = {2020-06-28T20:53:39.095Z},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2021-04-20T14:46:39.752Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {false},
 hidden = {false},
 citation_key = {Gliesch.EtAl/2020similarity},
 private_publication = {false},
 bibtype = {inproceedings},
 author = {Gliesch, A. and Ritt, M. and Cruz, A. H. S. and Moreira, M. C. O.},
 booktitle = {Annals of IEEE WORLD CONGRESS ON COMPUTATIONAL INTELLIGENCE (WCCI) 2020}
}

@article{
 title = {A Multiperiod Workforce Scheduling and Routing Problem with Dependent Tasks},
 type = {article},
 year = {2020},
 pages = {104930},
 volume = {118},
 websites = {https://www.sciencedirect.com/science/article/abs/pii/S0305054820300472},
 id = {761a0d15-69df-3ba8-9711-d7f34907247e},
 created = {2020-06-28T20:55:38.260Z},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2021-04-20T14:46:40.044Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {false},
 hidden = {false},
 citation_key = {Pereira.EtAl/2020},
 private_publication = {false},
 bibtype = {article},
 author = {Pereira, D. L. and Alves, J. C. and Moreira, M. C. O.},
 doi = {10.1016/j.cor.2020.104930},
 journal = {Computers & Operations Research}
}

@inproceedings{
 title = {Reactive GRASP-based Algorithm for Pallet Building Problem with Visibility and Contiguity Constraints},
 type = {inproceedings},
 year = {2020},
 pages = {651-665},
 websites = {https://link.springer.com/chapter/10.1007/978-3-030-59747-4_42},
 city = {Enschede},
 id = {ed82774e-2f85-3223-a477-defc82d47231},
 created = {2021-04-20T14:37:35.268Z},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2021-04-20T14:37:35.268Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 citation_key = {Iori.EtAl/2020},
 private_publication = {false},
 bibtype = {inproceedings},
 author = {Iori, Manuel and Locatelli, Marco and Moreira, Mayron César de Oliveira and Silveira, Tiago},
 booktitle = {International Conference on Computational Logistics}
}

@inproceedings{
 title = {Nesting problems with continuous rotations: a survey},
 type = {inproceedings},
 year = {2020},
 pages = {1-12},
 websites = {https://proceedings.science/sbpo-2020/papers/nesting-problems-with-continuous-rotations--a-survey},
 city = {João Pessoa},
 id = {e8d7a7b4-e329-3236-9c9a-15873e4fc66b},
 created = {2021-04-20T14:37:35.300Z},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2021-04-20T14:37:35.300Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 citation_key = {Ferreira.EtAl/2020},
 private_publication = {false},
 bibtype = {inproceedings},
 author = {Ferreira, A. S. and Moreira, M. C. O. and Andretta, M.},
 booktitle = {LII Simpósio Brasileiro de Pesquisa Operacional}
}

@inproceedings{
 title = {A Multistart Alternating Tabu Search for Commercial Districting},
 type = {inproceedings},
 year = {2018},
 pages = {158-173},
 websites = {https://link.springer.com/chapter/10.1007/978-3-319-77449-7_11},
 publisher = {Springer Nature},
 city = {Parma},
 id = {b472e1b0-5fe9-3adc-8897-8adff73db82d},
 created = {2018-02-21T21:44:39.960Z},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2018-10-06T22:33:47.073Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 private_publication = {false},
 abstract = {In this paper we address a class of commercial districting problems that arises in the context of the distribution of goods. The problem aims at partitioning an area of distribution, which is modeled as an embedded planar graph, into connected components, called districts. Districts are required to be mutually balanced with respect to node attributes, such as number of customers, expected demand, and service cost, and as geometrically-compact as possible, by minimizing their Euclidean diameters. To solve this problem, we propose a multistart algorithm that repeatedly constructs solutions greedily and improves them by two alternating tabu searches, one aiming at achieving feasibility through balancing and the other at maximizing district compactness. Computational experiments confirm the effectiveness of the different components of our method and show that it significantly outperforms the current state of the art, improving known upper bounds in almost all instances.},
 bibtype = {inproceedings},
 author = {Gliesch, A. and Ritt, M. and Moreira, M. C. O.},
 editor = {Liefooghe, A. and López-Ibáñez, M.},
 booktitle = {Annals of Evolutionary Computation in Combinatorial Optimization}
}

In this paper we address a class of commercial districting problems that arises in the context of the distribution of goods. The problem aims at partitioning an area of distribution, which is modeled as an embedded planar graph, into connected components, called districts. Districts are required to be mutually balanced with respect to node attributes, such as number of customers, expected demand, and service cost, and as geometrically-compact as possible, by minimizing their Euclidean diameters. To solve this problem, we propose a multistart algorithm that repeatedly constructs solutions greedily and improves them by two alternating tabu searches, one aiming at achieving feasibility through balancing and the other at maximizing district compactness. Computational experiments confirm the effectiveness of the different components of our method and show that it significantly outperforms the current state of the art, improving known upper bounds in almost all instances.

@inproceedings{
 title = {Modelo Matemático e Heurísticas para o Problema de Balanceamento de Linhas de Produção e Designação Hierárquica de Trabalhadores},
 type = {inproceedings},
 year = {2018},
 pages = {1-8},
 city = {Rio de Janeiro},
 id = {e0304709-0067-3282-83a5-15967c1b4c06},
 created = {2018-10-06T22:31:00.597Z},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2018-10-06T22:36:42.072Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {false},
 hidden = {false},
 private_publication = {false},
 abstract = {Estudamos o problema de balanceamento de linhas de produção e designação hierárquica de trabalhadores (ALBHW). No ALBHW, trabalhadores possuem habilidades hierarquicamente definidas, de forma que trabalhadores em níveis superiores geram mais custos à linha de produção, mas executam as tarefas com maior eficiência. O objetivo é selecionar quais tipos de trabalhadores devem ocupar cada estação de forma que o custo seja minimizado, respeitando restrições tecnológicas. Investigamos se a proposição de um novo modelo e de heurísticas podem resultar em soluções com melhor qualidade que as reportadas na literatura. Coube ao aluno de graduação, postulante do prêmio PIC/SBPO, a realização das atividades: (i) estudo bibliográfico; (ii) implementação de modelos e heurísticas (construtivas, busca local); (iii) sumarização e análise dos experimentos. Os resultados das propostas se mostraram satisfatórios e o projeto, de uma formal geral, cumpriu o seu papel de instigar ao aluno o interesse pela área de Pesquisa Operacional.},
 bibtype = {inproceedings},
 author = {Campana, N. P. and Moreira, M. C. O.},
 booktitle = {Anais do 50 Simpósio Brasileiro de Pesquisa Operacional}
}

Estudamos o problema de balanceamento de linhas de produção e designação hierárquica de trabalhadores (ALBHW). No ALBHW, trabalhadores possuem habilidades hierarquicamente definidas, de forma que trabalhadores em níveis superiores geram mais custos à linha de produção, mas executam as tarefas com maior eficiência. O objetivo é selecionar quais tipos de trabalhadores devem ocupar cada estação de forma que o custo seja minimizado, respeitando restrições tecnológicas. Investigamos se a proposição de um novo modelo e de heurísticas podem resultar em soluções com melhor qualidade que as reportadas na literatura. Coube ao aluno de graduação, postulante do prêmio PIC/SBPO, a realização das atividades: (i) estudo bibliográfico; (ii) implementação de modelos e heurísticas (construtivas, busca local); (iii) sumarização e análise dos experimentos. Os resultados das propostas se mostraram satisfatórios e o projeto, de uma formal geral, cumpriu o seu papel de instigar ao aluno o interesse pela área de Pesquisa Operacional.

@article{
 title = {The multi-objective assembly line worker integration and balancing problem of type-2},
 type = {article},
 year = {2017},
 pages = {114-125},
 volume = {82},
 websites = {http://www.sciencedirect.com/science/article/pii/S0305054817300059},
 id = {b9e74cf8-6361-3bf8-9f3e-6bb00ab977fb},
 created = {2017-02-07T15:33:25.000Z},
 accessed = {2017-02-07},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2017-03-15T01:49:32.045Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {false},
 hidden = {false},
 private_publication = {false},
 abstract = {The consideration of worker heterogeneity in assembly lines has received a fair amount of attention in the literature in the past decade. Most of this exploration uses as motivation the example of assembly lines in sheltered work centers for the disabled. Only recently has the community started looking at the situation faced in assembly lines in the general industrial park, when in the presence of worker heterogeneity. This step raises a number of questions around the best way to incorporate heterogeneous workers in the line, maximizing their integration while maintaining productivity levels. In this paper we propose the use of Miltenburg’s regularity criterion and cycle time as metrics for integration of workers and productivity, respectively. We then define, model and develop heuristics for a line balancing problem with these two goals. Results obtained through an extensive set of computational experiments indicate that a good planning can obtain trade-off solutions that perform well in both objectives.},
 bibtype = {article},
 author = {Moreira, Mayron César O. and Pastor, Rafael and Costa, Alysson M. and Miralles, Cristóbal},
 doi = {10.1016/j.cor.2017.01.003},
 journal = {Computers & Operations Research}
}

The consideration of worker heterogeneity in assembly lines has received a fair amount of attention in the literature in the past decade. Most of this exploration uses as motivation the example of assembly lines in sheltered work centers for the disabled. Only recently has the community started looking at the situation faced in assembly lines in the general industrial park, when in the presence of worker heterogeneity. This step raises a number of questions around the best way to incorporate heterogeneous workers in the line, maximizing their integration while maintaining productivity levels. In this paper we propose the use of Miltenburg’s regularity criterion and cycle time as metrics for integration of workers and productivity, respectively. We then define, model and develop heuristics for a line balancing problem with these two goals. Results obtained through an extensive set of computational experiments indicate that a good planning can obtain trade-off solutions that perform well in both objectives.

@inproceedings{
 title = {A genetic algorithm for fair land allocation},
 type = {inproceedings},
 year = {2017},
 keywords = {Gliesch_etal_2017},
 pages = {793-800},
 websites = {https://dl.acm.org/citation.cfm?id=3071313},
 publisher = {ACM},
 city = {Berlin},
 id = {6f3e81e6-984f-3007-b3dc-132703cad5b1},
 created = {2017-03-20T21:59:57.875Z},
 file_attached = {true},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2020-05-08T18:20:09.690Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 folder_uuids = {418968d6-a37c-409b-ad84-786ed498ab5f},
 private_publication = {false},
 abstract = {The goal of the PROTERRA project of the Brazilian National Institute of Colonization and Agrarian reform (INCRA) is to establish settlements of multiple families on land which formerly had a single owner. The main problem which arises in the project is to subdivide the land into lots to be designated to the families. This problem is difficult since several constraints stemming from legal or ethical considerations have to be considered. Among the constraints are respecting natural reserves, balancing access to rivers with the size of the lots, and a fair distribution with respect to soil quality. This problem has been mainly solved manually until now. In this paper we propose a genetic algorithm to solve it. We present several algorithmic components including a constructive heuristic and recombination and mutation operators that take into account the specifics of the problem, propose a technique to generate artificial instances for testing, and report on experiments with five real-world and 25 artificial instances.},
 bibtype = {inproceedings},
 author = {Gliesch, A. and Ritt, M. and Moreira, M. C. O.},
 doi = {10.1145/3071178.3071313},
 booktitle = {Proceedings of the Genetic and Evolutionary Computation Conference}
}

The goal of the PROTERRA project of the Brazilian National Institute of Colonization and Agrarian reform (INCRA) is to establish settlements of multiple families on land which formerly had a single owner. The main problem which arises in the project is to subdivide the land into lots to be designated to the families. This problem is difficult since several constraints stemming from legal or ethical considerations have to be considered. Among the constraints are respecting natural reserves, balancing access to rivers with the size of the lots, and a fair distribution with respect to soil quality. This problem has been mainly solved manually until now. In this paper we propose a genetic algorithm to solve it. We present several algorithmic components including a constructive heuristic and recombination and mutation operators that take into account the specifics of the problem, propose a technique to generate artificial instances for testing, and report on experiments with five real-world and 25 artificial instances.

@article{
 title = {Model and heuristics for the Assembly Line Worker Integration and Balancing Problem},
 type = {article},
 year = {2015},
 pages = {64-73},
 volume = {54},
 websites = {http://www.sciencedirect.com/science/article/pii/S0305054814002317},
 id = {a6959e78-1bf6-3ff6-bc82-37310e62139e},
 created = {2016-11-23T13:37:25.000Z},
 accessed = {2016-11-23},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2017-03-15T01:49:32.045Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 citation_key = {MoreiraEtAL_2015_cor},
 private_publication = {false},
 abstract = {We propose the Assembly Line Worker Integration and Balancing Problem (ALWIBP), a new assembly line balancing problem arising in lines with conventional and disabled workers. The goal of this problem is to maintain high productivity levels by minimizing the number of workstations needed to reach a given output, while integrating in the assembly line a number of disabled workers. Being able to efficiently manage a heterogeneous workforce is especially important in the current social context where companies are urged to integrate workers with different profiles. In this paper we present mathematical models and heuristic methodologies that can help assembly line managers to cope with this additional complexity. We demonstrate by means of a robust benchmark how this integration can be done with losses of productivity that are much lower than expected.},
 bibtype = {article},
 author = {Moreira, Mayron César O. and Miralles, Cristóbal and Costa, Alysson M.},
 doi = {10.1016/j.cor.2014.08.021},
 journal = {Computers & Operations Research}
}

We propose the Assembly Line Worker Integration and Balancing Problem (ALWIBP), a new assembly line balancing problem arising in lines with conventional and disabled workers. The goal of this problem is to maintain high productivity levels by minimizing the number of workstations needed to reach a given output, while integrating in the assembly line a number of disabled workers. Being able to efficiently manage a heterogeneous workforce is especially important in the current social context where companies are urged to integrate workers with different profiles. In this paper we present mathematical models and heuristic methodologies that can help assembly line managers to cope with this additional complexity. We demonstrate by means of a robust benchmark how this integration can be done with losses of productivity that are much lower than expected.

@article{
 title = {Robust assembly line balancing with heterogeneous workers},
 type = {article},
 year = {2015},
 pages = {254-263},
 volume = {88},
 websites = {http://www.sciencedirect.com/science/article/pii/S0360835215003058},
 id = {39ee30c9-864f-3359-a4d7-e28e77b88de7},
 created = {2016-11-23T13:41:05.000Z},
 accessed = {2016-11-23},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2017-03-15T01:49:32.045Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 citation_key = {MoreiraEtAl_2015_caie},
 private_publication = {false},
 abstract = {Assembly lines are manufacturing systems in which a product is assembled progressively in workstations by different workers or machines, each executing a subset of the needed assembly operations (or tasks). We consider the case in which task execution times are worker-dependent and uncertain, being expressed as intervals of possible values. Our goal is to find an assignment of tasks and workers to a minimal number of stations such that the resulting productivity level respects a desired robust measure. We propose two mixed-integer programming formulations for this problem and explain how these formulations can be adapted to handle the special case in which one must integrate a particular set of workers in the assembly line. We also present a fast construction heuristic that yields high quality solutions in just a fraction of the time needed to solve the problem to optimality. Computational results show the benefits of solving the robust optimization problem instead of its deterministic counterpart.},
 bibtype = {article},
 author = {Moreira, Mayron César O. and Cordeau, Jean-François and Costa, Alysson M. and Laporte, Gilbert},
 doi = {10.1016/j.cie.2015.07.004},
 journal = {Computers & Industrial Engineering}
}

Assembly lines are manufacturing systems in which a product is assembled progressively in workstations by different workers or machines, each executing a subset of the needed assembly operations (or tasks). We consider the case in which task execution times are worker-dependent and uncertain, being expressed as intervals of possible values. Our goal is to find an assignment of tasks and workers to a minimal number of stations such that the resulting productivity level respects a desired robust measure. We propose two mixed-integer programming formulations for this problem and explain how these formulations can be adapted to handle the special case in which one must integrate a particular set of workers in the assembly line. We also present a fast construction heuristic that yields high quality solutions in just a fraction of the time needed to solve the problem to optimality. Computational results show the benefits of solving the robust optimization problem instead of its deterministic counterpart.

@article{
 title = {Hybrid heuristics for planning job rotation schedules in assembly lines with heterogeneous workers},
 type = {article},
 year = {2013},
 pages = {552-560},
 volume = {141},
 websites = {http://www.sciencedirect.com/science/article/pii/S0925527312004070},
 id = {7600ed06-ff26-36be-bae9-816f534c81f7},
 created = {2016-11-23T13:43:35.000Z},
 accessed = {2016-11-23},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2017-03-15T01:49:32.045Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 citation_key = {MoreiraCosta_2013_ijpe},
 private_publication = {false},
 abstract = {We investigate the problem of balancing assembly lines with heterogeneous workers while considering job rotation schedules. This problem typically occurs in assembly lines in sheltered work centers for disabled. We propose a hybrid algorithm that uses a Mixed Integer Programming (MIP) to select appropriate schedules from a pool of heuristically constructed solutions. A local search based on MIP neighborhoods is used as a post-optimization method. Our results show that this approach is fast, flexible and accurate when compared with current available methods.},
 bibtype = {article},
 author = {Moreira, Mayron César O. and Costa, Alysson M.},
 doi = {10.1016/j.ijpe.2012.09.011},
 journal = {International Journal of Production Economics}
}

We investigate the problem of balancing assembly lines with heterogeneous workers while considering job rotation schedules. This problem typically occurs in assembly lines in sheltered work centers for disabled. We propose a hybrid algorithm that uses a Mixed Integer Programming (MIP) to select appropriate schedules from a pool of heuristically constructed solutions. A local search based on MIP neighborhoods is used as a post-optimization method. Our results show that this approach is fast, flexible and accurate when compared with current available methods.

@inproceedings{
 title = {Assembly line worker integration and balancing problem},
 type = {inproceedings},
 year = {2012},
 pages = {54-65},
 city = {Rio de Janeiro, Brasil},
 id = {e74d5c12-49f4-3ce1-b28b-1b8492697ba1},
 created = {2013-02-14T21:48:22.000Z},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2017-03-15T01:49:32.045Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 citation_key = {MoreiraEtAl_2012_sbpo},
 folder_uuids = {fa9d7e32-9b97-4fe2-9e9c-62c40efc637d},
 private_publication = {false},
 abstract = {We propose the Assembly Line Worker Integration and Balancing Problem (ALWIBP), a new assembly line balancing problem arising in lines with conventional and disabled workers. The goal of this problem is to maintain high productivity levels by minimizing the number of workstations needed to reach a given output, while including in the assembly line a number of disabled workers. This problem gains importance in the current social context, where companies are urged to integrate disabled workers in their labour force. Our results indicate that not only can these workers be integrated with little effect on the lines productivity but also that additional companies goals can be simultaneously considered.},
 bibtype = {inproceedings},
 author = {Moreira, M. C. O. and Miralles, C. and Costa, A. M.},
 booktitle = {Anais do XVI Congreso Latinoamericano de Investigación Operativa / XLIV Simpósio Brasileiro de Pesquisa Operacional}
}

We propose the Assembly Line Worker Integration and Balancing Problem (ALWIBP), a new assembly line balancing problem arising in lines with conventional and disabled workers. The goal of this problem is to maintain high productivity levels by minimizing the number of workstations needed to reach a given output, while including in the assembly line a number of disabled workers. This problem gains importance in the current social context, where companies are urged to integrate disabled workers in their labour force. Our results indicate that not only can these workers be integrated with little effect on the lines productivity but also that additional companies goals can be simultaneously considered.

@article{
 title = {Simple heuristics for the assembly line worker assignment and balancing problem},
 type = {article},
 year = {2012},
 pages = {505-524},
 volume = {18},
 websites = {http://dx.doi.org/10.1007/s10732-012-9195-5},
 id = {d42533dd-957a-3b71-8430-9e436fe5c138},
 created = {2016-11-23T13:43:51.000Z},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2017-03-15T01:49:32.045Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 citation_key = {MoreiraEtAl_2012_jh},
 source_type = {article},
 private_publication = {false},
 abstract = {We propose simple heuristics for the assembly line worker assignment and balancing problem. This problem typically occurs in assembly lines in sheltered work centers for the disabled. Different from the well-known simple assembly line balancing problem, the task execution times vary according to the assigned worker. We develop a constructive heuristic framework based on task and worker priority rules defining the order in which the tasks and workers should be assigned to the workstations. We present a number of such rules and compare their performance across three possible uses: as a stand-alone method, as an initial solution generator for meta-heuristics, and as a decoder for a hybrid genetic algorithm. Our results show that the heuristics are fast, they obtain good results as a stand-alone method and are efficient when used as a initial solution generator or as a solution decoder within more elaborate approaches.},
 bibtype = {article},
 author = {Moreira, Mayron César O and Ritt, Marcus and Costa, Alysson M and Chaves, Antonio A},
 doi = {10.1007/s10732-012-9195-5},
 journal = {Journal of Heuristics},
 number = {3}
}

We propose simple heuristics for the assembly line worker assignment and balancing problem. This problem typically occurs in assembly lines in sheltered work centers for the disabled. Different from the well-known simple assembly line balancing problem, the task execution times vary according to the assigned worker. We develop a constructive heuristic framework based on task and worker priority rules defining the order in which the tasks and workers should be assigned to the workstations. We present a number of such rules and compare their performance across three possible uses: as a stand-alone method, as an initial solution generator for meta-heuristics, and as a decoder for a hybrid genetic algorithm. Our results show that the heuristics are fast, they obtain good results as a stand-alone method and are efficient when used as a initial solution generator or as a solution decoder within more elaborate approaches.

@article{
 title = {Aptidão agrícola e algoritmos genéticos na organização espacial em projetos de reforma agrária},
 type = {article},
 year = {2011},
 pages = {255-261},
 volume = {35},
 websites = {http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0100-06832011000100024&lng=pt&nrm=iso&tlng=pt},
 month = {2},
 publisher = {Sociedade Brasileira de Ciência do Solo},
 id = {cbec8164-444e-317e-aa1b-ab5d2f050ed3},
 created = {2016-11-23T14:01:18.000Z},
 accessed = {2016-11-23},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2017-03-15T01:49:32.045Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 citation_key = {FerreiraNetoEtAl_2011_rbcs},
 private_publication = {false},
 abstract = {The definition of family settlement plots in land reform projects involves technical and social issues. These aspects are mainly related to differences in the agricultural suitability of the soil in these projects. The objective of this study was to introduce a procedure for an optimal subdivision of the land by cross-linking projects by a Genetic Algorithm (GA). The GA was tested in the rural settlement Veredas, located in Padre Paraíso, in the region of the Vale do Jequitinhonha, State of Minas Gerais, Brazil. It was implemented based on the soil suitability and productivity index. },
 bibtype = {article},
 author = {Ferreira Neto, Jose Ambrósio and Moreira, Mayron César de Oliveira and Santos Junior, Edgard Carneiro dos and Paleo, Urbano Fra and Lani, João Luiz},
 doi = {10.1590/S0100-06832011000100024},
 journal = {Revista Brasileira de Ciência do Solo}
}

The definition of family settlement plots in land reform projects involves technical and social issues. These aspects are mainly related to differences in the agricultural suitability of the soil in these projects. The objective of this study was to introduce a procedure for an optimal subdivision of the land by cross-linking projects by a Genetic Algorithm (GA). The GA was tested in the rural settlement Veredas, located in Padre Paraíso, in the region of the Vale do Jequitinhonha, State of Minas Gerais, Brazil. It was implemented based on the soil suitability and productivity index.

@article{
 title = {Optimal subdivision of land in agrarian reform projects: an analysis using genetic algorithms},
 type = {article},
 year = {2011},
 keywords = {Agrarian reform,genetic algorithm,rural settlement,spatial planning},
 pages = {169-178},
 volume = {38},
 websites = {http://rcia.uc.cl/index.php/rcia/article/view/111},
 id = {db390d9c-c661-3183-9e49-e9eed1b712b5},
 created = {2016-11-23T16:10:39.000Z},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2017-03-15T01:49:32.045Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 citation_key = {FerreiraNetoEtAl_2011_cia},
 source_type = {article},
 private_publication = {false},
 abstract = {The objective of this manuscript is to develop a new procedure to achieve optimal land subdivision using genetic algorithms (GA). The genetic algorithm was tested in the rural settlement of Veredas, located in Minas Gerais, Brazil. This implementation was based on the land aptitude and its productivity index. The sequence of tests in the study was carried out in two areas with eight different agricultural aptitude classes, including one area of 391.88 ha subdivided into 12 lots and another of 404.1763 ha subdivided into 14 lots. The effectiveness of the method was measured using the shunting line standard value of a parceled area lot’s productivity index. To evaluate each parameter, a sequence of 15 calculations was performed to record the best individual fitness average (MMI) found for each parameter variation. The best parameter combination found in testing and used to generate the new parceling with the GA was the following: 320 as the generation number, a population of 40 individuals, 0.8 mutation tax, and a 0.3 renewal tax. The solution generated rather homogeneous lots in terms of productive capacity.},
 bibtype = {article},
 author = {Ferreira Neto, José Ambrósio and dos Santos Junior, Edgard Carneiro and Paleo, Urbano Fra and Moreira, Mayron César de Oliveira},
 doi = {http://dx.doi.org/10.4067/rcia.v38i2.111},
 journal = {Ciencia e Investigación Agraria}
}

The objective of this manuscript is to develop a new procedure to achieve optimal land subdivision using genetic algorithms (GA). The genetic algorithm was tested in the rural settlement of Veredas, located in Minas Gerais, Brazil. This implementation was based on the land aptitude and its productivity index. The sequence of tests in the study was carried out in two areas with eight different agricultural aptitude classes, including one area of 391.88 ha subdivided into 12 lots and another of 404.1763 ha subdivided into 14 lots. The effectiveness of the method was measured using the shunting line standard value of a parceled area lot’s productivity index. To evaluate each parameter, a sequence of 15 calculations was performed to record the best individual fitness average (MMI) found for each parameter variation. The best parameter combination found in testing and used to generate the new parceling with the GA was the following: 320 as the generation number, a population of 40 individuals, 0.8 mutation tax, and a 0.3 renewal tax. The solution generated rather homogeneous lots in terms of productive capacity.

@inbook{
 type = {inbook},
 year = {2011},
 pages = {265-272},
 publisher = {Suprema},
 city = {Visconde do rio Branco},
 edition = {1},
 id = {f4717537-8269-36fc-a9de-e338cf512860},
 created = {2017-01-03T19:05:58.000Z},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2017-03-15T01:49:32.045Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {false},
 hidden = {false},
 citation_key = {Moreira2011},
 private_publication = {false},
 bibtype = {inbook},
 author = {Moreira, M. C. O. and Ferreira Neto, J. A. and Einloft, C. J. and Silva, N. T. C.},
 editor = {José Ambrósio Ferreira Neto Carlos Joaquim Einloft, undefined and Renato Luiz Gonçalves, undefined},
 chapter = {O uso da busca tabu no ordenamento territorial em assentamentos rurais: reconfigurando o SOTER-PA (Sistema de Ordenamento Territorial da Reforma Agrária e Planejamento Ambiental)},
 title = {Desenvolvimento Rural, sustentabilidade e ordenamento territorial}
}

@inproceedings{
 title = {Princípios de Cartografia Social em Diagnósticos Participativos em Projetos de Reforma Agrária},
 type = {inproceedings},
 year = {2010},
 pages = {993-1002},
 city = {Aveiro},
 id = {c7aa00f3-441d-3347-bbe0-5d1bac6ef53d},
 created = {2016-11-23T16:10:39.000Z},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2017-03-15T01:49:32.045Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 private_publication = {false},
 bibtype = {inproceedings},
 author = {Milagres, C. S. F. and Ferreira Neto, J. A. and Moura, R. A. and Moreira, M. C. O.},
 booktitle = {Anais do IV Congresso de Estudos Rurais}
}

@inbook{
 type = {inbook},
 year = {2010},
 pages = {238-248},
 publisher = {Suprema},
 city = {Visconde do Rio Branco},
 edition = {1},
 id = {2535afb7-7b87-3131-a79e-f5f39e95a630},
 created = {2017-01-03T19:08:10.000Z},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2017-03-15T01:49:32.045Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {false},
 hidden = {false},
 citation_key = {FerreiraNeto2010},
 private_publication = {false},
 bibtype = {inbook},
 author = {Ferreira Neto, J. A. and Milagres, C. S. F. and Sousa, D. N. and Moreira, M. C. O.},
 editor = {José Ambrósio Ferreira Neto Diego Neves de Souza, undefined and Cleiton Silva Ferreira Milagres, undefined},
 chapter = {O uso do aplicativo SOTER e da cartografia social na organização territorial em projetos de reforma agrária},
 title = {Recursos Naturais, Sistemas de Informação Geográfica e Processos Sociais}
}

@inproceedings{
 title = {A minimalist yet efficient tabu search algorithm for balancing assembly lines with disabled workers},
 type = {inproceedings},
 year = {2009},
 pages = {660-671},
 city = {Porto Seguro, Brasil},
 id = {788d88b7-5dea-3433-b0c4-9fa163894dbb},
 created = {2012-02-06T13:50:46.000Z},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2017-03-15T01:49:32.045Z},
 read = {true},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 citation_key = {moreira2009minimalist},
 folder_uuids = {fa9d7e32-9b97-4fe2-9e9c-62c40efc637d,1a1db06d-3666-4c6d-b24d-c64de105eaa8},
 private_publication = {false},
 abstract = {We face the problem of programming assembly lines when each task has a different completion time
depending on the worker assigned to its execution.  This problem appears in the context of sheltered
work centers for the disabled,  where the workers have disabilities that might impede or difficult the
carrying  out  of  some  tasks.   We  develop  a  tabu  search  algorithm  for  solving  this  problem.   In  the designing of this algorithm, we have proposed and followed several guidelines intended to make the method as simple, flexible, accurate and fast as possible. We compare the proposed approach with more sophisticated methods available for the same problem in the literature.  Although we have not focused on accuracy and speed, as it is usually the case in the Operations Research literature, the results show that the algorithm outperforms other methods even in these criteria.},
 bibtype = {inproceedings},
 author = {Moreira, M. C. O. and Costa, A. M.},
 booktitle = {Anais do XLI Simpósio Brasileiro de Pesquisa Operacional}
}

We face the problem of programming assembly lines when each task has a different completion time depending on the worker assigned to its execution. This problem appears in the context of sheltered work centers for the disabled, where the workers have disabilities that might impede or difficult the carrying out of some tasks. We develop a tabu search algorithm for solving this problem. In the designing of this algorithm, we have proposed and followed several guidelines intended to make the method as simple, flexible, accurate and fast as possible. We compare the proposed approach with more sophisticated methods available for the same problem in the literature. Although we have not focused on accuracy and speed, as it is usually the case in the Operations Research literature, the results show that the algorithm outperforms other methods even in these criteria.

@inproceedings{
 title = {Um algoritmo genético híbrido para o problema no-wait flowshop com makespan e atraso máximo},
 type = {inproceedings},
 year = {2009},
 pages = {2109-2120},
 city = {Porto Seguro},
 id = {66457900-76bf-3c17-a52d-9fc52181c674},
 created = {2016-11-23T14:01:34.000Z},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2017-03-15T01:49:32.045Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 citation_key = {JanuarioEtAl_2009},
 source_type = {article},
 private_publication = {false},
 abstract = {This paper considers the 
m-machine no-wait permutation flowshop scheduling problem, with the objective of minimizing the linear combination of makespan and maximum lateness performance measures.  In  this  problem,  a  job  must  be  processed  from  start  to  completion,  without  any interruption either on or between machines. To solve the problem, we present an efficient genetic algorithm that uses a local search procedure to improve the quality of the solutions generated by the crossover and mutation operators. The performance of the proposed hybrid genetic algorithm is evaluated doing an extensive computational analysis on a set of 4800 instances involving up to 100  jobs  and  20  machines.  The  obtained  results  show  that  the  developed metaheuristic  is  very efficient  and  perform  better  than the  best existing  heuristics from  the  literature  proposed for  the same problem boarded in this paper. },
 bibtype = {inproceedings},
 author = {Januario, Tiago de Oliveira and Moreira, Mayron César de Oliveira and Arroyo, José Elias Claudio and Santos, André Gustavo dos},
 booktitle = {Anais do XLI Simpósio Brasileiro de Pesquisa Operacional}
}

This paper considers the m-machine no-wait permutation flowshop scheduling problem, with the objective of minimizing the linear combination of makespan and maximum lateness performance measures. In this problem, a job must be processed from start to completion, without any interruption either on or between machines. To solve the problem, we present an efficient genetic algorithm that uses a local search procedure to improve the quality of the solutions generated by the crossover and mutation operators. The performance of the proposed hybrid genetic algorithm is evaluated doing an extensive computational analysis on a set of 4800 instances involving up to 100 jobs and 20 machines. The obtained results show that the developed metaheuristic is very efficient and perform better than the best existing heuristics from the literature proposed for the same problem boarded in this paper.

@inbook{
 type = {inbook},
 year = {2009},
 pages = {153-164},
 websites = {http://link.springer.com/chapter/10.1007%2F978-3-642-03211-0_13},
 publisher = {Springer Heidelberg},
 city = {Berlin},
 id = {889e2d67-3e70-3106-904e-bfbff847ae96},
 created = {2016-11-23T14:01:34.000Z},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2017-03-15T01:49:32.045Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 citation_key = {januario2009genetic},
 source_type = {incollection},
 private_publication = {false},
 abstract = {This paper considers the permutation flowshop scheduling problem with blocking in-process with the objective of minimizing the total tardiness of jobs. In this problem there are no buffers between successive machines, that is, it is not allowed intermediate queues of jobs waiting in the system for their subsequent operations. To solve the problem, we propose a genetic algorithm that includes strategies like local search, a procedure to control over the diversity of the population and a intensification procedure based on the path relinking technique. The path relinking technique generates new solutions transforming one elite solution to another one of the population. The performance of the proposed genetic algorithm is evaluated comparing with a GRASP metaheuristic with path relinking from the literature. Computational tests show that the genetic algorithm is very efficient and promising.},
 bibtype = {inbook},
 author = {Januario, Tiago de O and Arroyo, José Elias C and Moreira, Mayron César O},
 doi = {10.1007/978-3-642-03211-0_13},
 chapter = {Genetic Algorithm for Tardiness Minimization in Flowshop with Blocking},
 title = {Nature Inspired Cooperative Strategies for Optimization (NICSO 2008)}
}

This paper considers the permutation flowshop scheduling problem with blocking in-process with the objective of minimizing the total tardiness of jobs. In this problem there are no buffers between successive machines, that is, it is not allowed intermediate queues of jobs waiting in the system for their subsequent operations. To solve the problem, we propose a genetic algorithm that includes strategies like local search, a procedure to control over the diversity of the population and a intensification procedure based on the path relinking technique. The path relinking technique generates new solutions transforming one elite solution to another one of the population. The performance of the proposed genetic algorithm is evaluated comparing with a GRASP metaheuristic with path relinking from the literature. Computational tests show that the genetic algorithm is very efficient and promising.

@inproceedings{
 title = {Análise da eficiência de linhas de produção com trabalhadores deficientes},
 type = {inproceedings},
 year = {2009},
 pages = {698-709},
 city = {Porto Seguro},
 id = {fd3528e9-1c12-33ae-9338-97069d80298f},
 created = {2016-11-23T16:10:39.000Z},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2017-03-15T01:49:32.045Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 private_publication = {false},
 abstract = {People with disabilities are usually excluded from the work market. Although the reasons for this fact
are various, it is clear that prejudice plays an important role in this undesired phenomenon. This articles tries to contribute in this matter by showing that the idea that disabled workers cannot appropriately contribute in the productive processes is false.  Indeed, our results show that, with a good assembly line programming, the performances of lines with and without disabled workers are virtually the same. This leads to the question of obtaining good programmings. In this article, we propose a mathematical model that is specific for the case where the assembly line has a single disabled worker. Computational results show the efficacy of this new formulation.},
 bibtype = {inproceedings},
 author = {Costa, A. M. and Santos, L. M. R. and Moreira, M. C. O.},
 booktitle = {Anais do XLI Simpósio Brasileiro de Pesquisa Operacional}
}

People with disabilities are usually excluded from the work market. Although the reasons for this fact are various, it is clear that prejudice plays an important role in this undesired phenomenon. This articles tries to contribute in this matter by showing that the idea that disabled workers cannot appropriately contribute in the productive processes is false. Indeed, our results show that, with a good assembly line programming, the performances of lines with and without disabled workers are virtually the same. This leads to the question of obtaining good programmings. In this article, we propose a mathematical model that is specific for the case where the assembly line has a single disabled worker. Computational results show the efficacy of this new formulation.

@book{
 title = {Terraço 4.1 - Práticas mecânicas para a conservação de solo e água em áreas agrícolas},
 type = {book},
 year = {2009},
 pages = {88},
 publisher = {AEAGRI},
 city = {Viçosa},
 edition = {1},
 id = {0d912076-0e08-3a8a-8957-f520a52a8c49},
 created = {2017-01-03T19:02:15.000Z},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2017-03-15T01:49:32.045Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {false},
 hidden = {false},
 private_publication = {false},
 bibtype = {book},
 author = {Pruski, F. P. and Moreira, G. T. G. and Silva, J. M. A. and Oliveira, C. P. F. and Moreira, M. C. O. and Griebeler, N. P. and Andrade, M. V. A. and Teixeira, A. F.}
}

@inproceedings{
 title = {Algoritmo Genético com Busca Local Para a Minimização do Atraso Total das Tarefas no Problema de Programação Flowshop Permutacional},
 type = {inproceedings},
 year = {2008},
 pages = {1-12},
 id = {442f6750-4432-3f50-bd7c-469ece59d084},
 created = {2016-11-23T14:01:34.000Z},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2017-03-15T01:49:32.045Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 citation_key = {Januario_EtAl_2008_cba},
 source_type = {article},
 private_publication = {false},
 bibtype = {inproceedings},
 author = {Januario, Tiago de Oliveira and Arroyo, José Elias Claudio and Moreira, Mayron César de Oliveira},
 booktitle = {Proccedings of XVII Congresso Brasileiro de Automática}
}

@inproceedings{
 title = {Um algoritmo evolutivo para o problema de Job Shop Scheduling bi-objetivo},
 type = {inproceedings},
 year = {2008},
 pages = {1-12},
 city = {Joao Pessoa},
 id = {6d4f7188-b264-35f2-ba99-fa74056b8518},
 created = {2016-11-23T14:01:34.000Z},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2017-03-15T01:49:32.045Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 citation_key = {MoreiraEtAl_2008_sbpo},
 source_type = {article},
 private_publication = {false},
 abstract = {This  article  considers  the  Job  Shop  Sche
duling  Problem  bi-objective  in  which  the   makespan and total tardiness of jobs are minimized. In order to find a set of dominant solutions, that is,  an  approximation  of  the  Pareto  optimal  solutions,  a  genetic  algorithm  is  proposed  including strategies such as local search, a form of adaptation of the population of solutions and a post-optimization  procedure based  on  Path  Relinking technique.  We  made  a  study  of  genetic  algorithm  with  each  of  the  strategies  used.  Thus,  the  performance  of  the  three  versions  of  the  algorithm  is  analyzed:  Basic  Genetic  Algorithm  (BGA),  Genetic  Algorithm  with  Local  Search  procedure  (GLSA)  and  Genetic  Algorithm  with  Local  Search  and  Path  Relinking  procedures  (GLSAPR). The best version of the proposed algorithm is compared with other genetic algorithm proposed recently in the literature. },
 bibtype = {inproceedings},
 author = {Moreira, Mayron César de Oliveira and Arroyo, José Elias Claudio and Januário, Tiago de Oliveira and Oliveira Júnior, Paulo Lúcio},
 booktitle = {Anais do XL Simpósio Brasileiro de Pesquisa Operacional}
}

This article considers the Job Shop Sche duling Problem bi-objective in which the makespan and total tardiness of jobs are minimized. In order to find a set of dominant solutions, that is, an approximation of the Pareto optimal solutions, a genetic algorithm is proposed including strategies such as local search, a form of adaptation of the population of solutions and a post-optimization procedure based on Path Relinking technique. We made a study of genetic algorithm with each of the strategies used. Thus, the performance of the three versions of the algorithm is analyzed: Basic Genetic Algorithm (BGA), Genetic Algorithm with Local Search procedure (GLSA) and Genetic Algorithm with Local Search and Path Relinking procedures (GLSAPR). The best version of the proposed algorithm is compared with other genetic algorithm proposed recently in the literature.

@inproceedings{
 title = {Genetic Algorithms for Bi-Objective Job Shop Scheduling Problem},
 type = {inproceedings},
 year = {2008},
 pages = {720-725},
 websites = {http://ieeexplore.ieee.org/document/4626716/?reload=true},
 publisher = {IEEE},
 city = {Barcelona},
 id = {b97b56e7-bc43-3ccb-bc93-1cfbfcb15692},
 created = {2016-11-23T14:01:34.000Z},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2017-03-15T01:49:32.045Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 citation_key = {MoreiraEtAl_2008_his},
 source_type = {article},
 private_publication = {false},
 abstract = {This article considers the bi-objective Job Shop Scheduling Problem in which the make span and the total tardiness of jobs are minimized. In order to find a set of dominant solutions, that is, an approximation of the Pareto optimal solutions, we propose three versions of a genetic algorithm with techniques like hybridization with local search, path relinking and elitism. The three versions of the algorithm are compared with each other and they are also compared with other multiobjective genetic algorithm proposed in the literature.},
 bibtype = {inproceedings},
 author = {Moreira, Mayron C O and Arroyo, José E C and Januario, Tiago O and Oliveira, Paulo L},
 doi = {10.1109/HIS.2008.43},
 booktitle = {Proccedings of 8th International Conference on Hibrid Intelligent Systems}
}

This article considers the bi-objective Job Shop Scheduling Problem in which the make span and the total tardiness of jobs are minimized. In order to find a set of dominant solutions, that is, an approximation of the Pareto optimal solutions, we propose three versions of a genetic algorithm with techniques like hybridization with local search, path relinking and elitism. The three versions of the algorithm are compared with each other and they are also compared with other multiobjective genetic algorithm proposed in the literature.

@inproceedings{
 title = {Genetic local search algorithm for the minimum total tardiness permutation flowshop problem},
 type = {inproceedings},
 year = {2008},
 pages = {115-121},
 websites = {http://ieeexplore.ieee.org/document/4625049/},
 publisher = {IEEE},
 city = {Sao Paulo},
 institution = {IEEE},
 id = {5125e63a-d4f7-3ce5-9210-14f8a1ea2f0f},
 created = {2016-11-23T14:01:34.000Z},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2017-03-15T01:49:32.045Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 citation_key = {JanuarioEtAl_2008_ieee},
 source_type = {inproceedings},
 private_publication = {false},
 abstract = {This paper considers the permutation flowshop scheduling problem with blocking in-process with the objective of minimizing the total tardiness of jobs. In this problem there are no buffers between successive machines, that is, it is not allowed intermediate queues of jobs waiting in the system for their next operations. To solve the problem, we propose a genetic algorithm that includes strategies like local search, a procedure to control the diversity of the population and a procedure of intensification based on the path relinking technique. The path relinking technique generates news solutions transforming one elite solution to another one of the population. The performance of the proposed genetic algorithm is evaluated comparing with a constructive heuristic literature. Computational tests show that the algorithm is very efficient and promising.},
 bibtype = {inproceedings},
 author = {Januario, Tiago de Oliveira and Arroyo, José Elias Claudio and Moreira, Mayron César de Oliveira and Kampke, Edmar Hell},
 doi = {10.1109/CSEW.2008.12},
 booktitle = {11th IEEE International Conference on Computational Science and Engineering}
}

This paper considers the permutation flowshop scheduling problem with blocking in-process with the objective of minimizing the total tardiness of jobs. In this problem there are no buffers between successive machines, that is, it is not allowed intermediate queues of jobs waiting in the system for their next operations. To solve the problem, we propose a genetic algorithm that includes strategies like local search, a procedure to control the diversity of the population and a procedure of intensification based on the path relinking technique. The path relinking technique generates news solutions transforming one elite solution to another one of the population. The performance of the proposed genetic algorithm is evaluated comparing with a constructive heuristic literature. Computational tests show that the algorithm is very efficient and promising.

@article{
 title = {Algoritmo Genético com Busca Local para a Minimização do Atraso Total das Tarefas no Problema de Programação Flowshop Permutacional com Buffer Zero},
 type = {article},
 year = {2008},
 volume = {IV},
 id = {d88f5779-e1e1-3da6-8578-6b655c2ac88d},
 created = {2016-11-23T16:10:39.000Z},
 file_attached = {false},
 profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},
 last_modified = {2017-03-15T01:49:32.045Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 citation_key = {Januario2008},
 private_publication = {false},
 bibtype = {article},
 author = {Januario, Tiago de Oliveira and Arroyo, José Elias Claudio and Moreira, Mayron César de Oliveira},
 journal = {Revista Eletrônica de Iniciação Científica}
}