var bibbase_data = {"data":"<img src=\"//bibbase.org/img/ajax-loader.gif\" id=\"spinner\"\n  style=\"display: none;\" alt=\"Loading..\" />\n\n<div id=\"bibbase\">\n\n  <script type=\"text/javascript\">\n    var bibbase = {\n      params: {\"jsonp\":\"1\",\"host\":\"bibbase.org\",\"ssl\":false},\n      data: [{\"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\\r\\ndepending on the worker assigned to its execution.  This problem appears in the context of sheltered\\r\\nwork centers for the disabled,  where the workers have disabilities that might impede or difficult the\\r\\ncarrying  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\",\"bibtex\":\"@inproceedings{\\n title = {A minimalist yet efficient tabu search algorithm for balancing assembly lines with disabled workers},\\n type = {inproceedings},\\n year = {2009},\\n pages = {660-671},\\n city = {Porto Seguro, Brasil},\\n id = {788d88b7-5dea-3433-b0c4-9fa163894dbb},\\n created = {2012-02-06T13:50:46.000Z},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2017-03-15T01:49:32.045Z},\\n read = {true},\\n starred = {false},\\n authored = {true},\\n confirmed = {true},\\n hidden = {false},\\n citation_key = {moreira2009minimalist},\\n folder_uuids = {fa9d7e32-9b97-4fe2-9e9c-62c40efc637d,1a1db06d-3666-4c6d-b24d-c64de105eaa8},\\n private_publication = {false},\\n abstract = {We face the problem of programming assembly lines when each task has a different completion time\\r\\ndepending on the worker assigned to its execution.  This problem appears in the context of sheltered\\r\\nwork centers for the disabled,  where the workers have disabilities that might impede or difficult the\\r\\ncarrying  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.},\\n bibtype = {inproceedings},\\n author = {Moreira, M. C. O. and Costa, A. M.},\\n booktitle = {Anais do XLI Simpósio Brasileiro de Pesquisa Operacional}\\n}\",\"author_short\":[\"Moreira,  M., C., O.\",\"Costa,  A., M.\"],\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"moreira-costa-aminimalistyetefficienttabusearchalgorithmforbalancingassemblylineswithdisabledworkers-2009\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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\",\"bibtex\":\"@inproceedings{\\n title = {Assembly line worker integration and balancing problem},\\n type = {inproceedings},\\n year = {2012},\\n pages = {54-65},\\n city = {Rio de Janeiro, Brasil},\\n id = {e74d5c12-49f4-3ce1-b28b-1b8492697ba1},\\n created = {2013-02-14T21:48:22.000Z},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2017-03-15T01:49:32.045Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {true},\\n hidden = {false},\\n citation_key = {MoreiraEtAl_2012_sbpo},\\n folder_uuids = {fa9d7e32-9b97-4fe2-9e9c-62c40efc637d},\\n private_publication = {false},\\n 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.},\\n bibtype = {inproceedings},\\n author = {Moreira, M. C. O. and Miralles, C. and Costa, A. M.},\\n booktitle = {Anais do XVI Congreso Latinoamericano de Investigación Operativa / XLIV Simpósio Brasileiro de Pesquisa Operacional}\\n}\",\"author_short\":[\"Moreira,  M., C., O.\",\"Miralles,  C.\",\"Costa,  A., M.\"],\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"moreira-miralles-costa-assemblylineworkerintegrationandbalancingproblem-2012\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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\",\"bibtex\":\"@article{\\n title = {Model and heuristics for the Assembly Line Worker Integration and Balancing Problem},\\n type = {article},\\n year = {2015},\\n pages = {64-73},\\n volume = {54},\\n websites = {http://www.sciencedirect.com/science/article/pii/S0305054814002317},\\n id = {a6959e78-1bf6-3ff6-bc82-37310e62139e},\\n created = {2016-11-23T13:37:25.000Z},\\n accessed = {2016-11-23},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2017-03-15T01:49:32.045Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {true},\\n hidden = {false},\\n citation_key = {MoreiraEtAL_2015_cor},\\n private_publication = {false},\\n 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.},\\n bibtype = {article},\\n author = {Moreira, Mayron César O. and Miralles, Cristóbal and Costa, Alysson M.},\\n doi = {10.1016/j.cor.2014.08.021},\\n journal = {Computers & Operations Research}\\n}\",\"author_short\":[\"Moreira,  M., C., O.\",\"Miralles,  C.\",\"Costa,  A., M.\"],\"urls\":{\"Website\":\"http://www.sciencedirect.com/science/article/pii/S0305054814002317\"},\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"moreira-miralles-costa-modelandheuristicsfortheassemblylineworkerintegrationandbalancingproblem-2015\",\"role\":\"author\",\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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\",\"bibtex\":\"@article{\\n title = {Robust assembly line balancing with heterogeneous workers},\\n type = {article},\\n year = {2015},\\n pages = {254-263},\\n volume = {88},\\n websites = {http://www.sciencedirect.com/science/article/pii/S0360835215003058},\\n id = {39ee30c9-864f-3359-a4d7-e28e77b88de7},\\n created = {2016-11-23T13:41:05.000Z},\\n accessed = {2016-11-23},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2017-03-15T01:49:32.045Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {true},\\n hidden = {false},\\n citation_key = {MoreiraEtAl_2015_caie},\\n private_publication = {false},\\n 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.},\\n bibtype = {article},\\n author = {Moreira, Mayron César O. and Cordeau, Jean-François and Costa, Alysson M. and Laporte, Gilbert},\\n doi = {10.1016/j.cie.2015.07.004},\\n journal = {Computers & Industrial Engineering}\\n}\",\"author_short\":[\"Moreira,  M., C., O.\",\"Cordeau,  J.\",\"Costa,  A., M.\",\"Laporte,  G.\"],\"urls\":{\"Website\":\"http://www.sciencedirect.com/science/article/pii/S0360835215003058\"},\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"moreira-cordeau-costa-laporte-robustassemblylinebalancingwithheterogeneousworkers-2015\",\"role\":\"author\",\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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\",\"bibtex\":\"@article{\\n title = {Hybrid heuristics for planning job rotation schedules in assembly lines with heterogeneous workers},\\n type = {article},\\n year = {2013},\\n pages = {552-560},\\n volume = {141},\\n websites = {http://www.sciencedirect.com/science/article/pii/S0925527312004070},\\n id = {7600ed06-ff26-36be-bae9-816f534c81f7},\\n created = {2016-11-23T13:43:35.000Z},\\n accessed = {2016-11-23},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2017-03-15T01:49:32.045Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {true},\\n hidden = {false},\\n citation_key = {MoreiraCosta_2013_ijpe},\\n private_publication = {false},\\n 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.},\\n bibtype = {article},\\n author = {Moreira, Mayron César O. and Costa, Alysson M.},\\n doi = {10.1016/j.ijpe.2012.09.011},\\n journal = {International Journal of Production Economics}\\n}\",\"author_short\":[\"Moreira,  M., C., O.\",\"Costa,  A., M.\"],\"urls\":{\"Website\":\"http://www.sciencedirect.com/science/article/pii/S0925527312004070\"},\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"moreira-costa-hybridheuristicsforplanningjobrotationschedulesinassemblylineswithheterogeneousworkers-2013\",\"role\":\"author\",\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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\",\"bibtex\":\"@article{\\n title = {Simple heuristics for the assembly line worker assignment and balancing problem},\\n type = {article},\\n year = {2012},\\n pages = {505-524},\\n volume = {18},\\n websites = {http://dx.doi.org/10.1007/s10732-012-9195-5},\\n id = {d42533dd-957a-3b71-8430-9e436fe5c138},\\n created = {2016-11-23T13:43:51.000Z},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2017-03-15T01:49:32.045Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {true},\\n hidden = {false},\\n citation_key = {MoreiraEtAl_2012_jh},\\n source_type = {article},\\n private_publication = {false},\\n 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.},\\n bibtype = {article},\\n author = {Moreira, Mayron César O and Ritt, Marcus and Costa, Alysson M and Chaves, Antonio A},\\n doi = {10.1007/s10732-012-9195-5},\\n journal = {Journal of Heuristics},\\n number = {3}\\n}\",\"author_short\":[\"Moreira,  M., C., O.\",\"Ritt,  M.\",\"Costa,  A., M.\",\"Chaves,  A., A.\"],\"urls\":{\"Website\":\"http://dx.doi.org/10.1007/s10732-012-9195-5\"},\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"moreira-ritt-costa-chaves-simpleheuristicsfortheassemblylineworkerassignmentandbalancingproblem-2012\",\"role\":\"author\",\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":1,\"html\":\"\"},{\"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\",\"bibtex\":\"@article{\\n title = {Aptidão agrícola e algoritmos genéticos na organização espacial em projetos de reforma agrária},\\n type = {article},\\n year = {2011},\\n pages = {255-261},\\n volume = {35},\\n websites = {http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0100-06832011000100024&lng=pt&nrm=iso&tlng=pt},\\n month = {2},\\n publisher = {Sociedade Brasileira de Ciência do Solo},\\n id = {cbec8164-444e-317e-aa1b-ab5d2f050ed3},\\n created = {2016-11-23T14:01:18.000Z},\\n accessed = {2016-11-23},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2017-03-15T01:49:32.045Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {true},\\n hidden = {false},\\n citation_key = {FerreiraNetoEtAl_2011_rbcs},\\n private_publication = {false},\\n 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. },\\n bibtype = {article},\\n 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},\\n doi = {10.1590/S0100-06832011000100024},\\n journal = {Revista Brasileira de Ciência do Solo}\\n}\",\"author_short\":[\"Ferreira Neto,  J., A.\",\"Moreira,  M., C., d., O.\",\"Santos Junior,  E., C., d.\",\"Paleo,  U., F.\",\"Lani,  J., L.\"],\"urls\":{\"Website\":\"http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0100-06832011000100024&lng=pt&nrm=iso&tlng=pt\"},\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"ferreiraneto-moreira-santosjunior-paleo-lani-aptidoagrcolaealgoritmosgenticosnaorganizaoespacialemprojetosdereformaagrria-2011\",\"role\":\"author\",\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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 \\r\\nm-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\",\"bibtex\":\"@inproceedings{\\n title = {Um algoritmo genético híbrido para o problema no-wait flowshop com makespan e atraso máximo},\\n type = {inproceedings},\\n year = {2009},\\n pages = {2109-2120},\\n city = {Porto Seguro},\\n id = {66457900-76bf-3c17-a52d-9fc52181c674},\\n created = {2016-11-23T14:01:34.000Z},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2017-03-15T01:49:32.045Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {true},\\n hidden = {false},\\n citation_key = {JanuarioEtAl_2009},\\n source_type = {article},\\n private_publication = {false},\\n abstract = {This paper considers the \\r\\nm-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. },\\n bibtype = {inproceedings},\\n author = {Januario, Tiago de Oliveira and Moreira, Mayron César de Oliveira and Arroyo, José Elias Claudio and Santos, André Gustavo dos},\\n booktitle = {Anais do XLI Simpósio Brasileiro de Pesquisa Operacional}\\n}\",\"author_short\":[\"Januario,  T., d., O.\",\"Moreira,  M., C., d., O.\",\"Arroyo,  J., E., C.\",\"Santos,  A., G., d.\"],\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"januario-moreira-arroyo-santos-umalgoritmogenticohbridoparaoproblemanowaitflowshopcommakespaneatrasomximo-2009\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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\",\"bibtex\":\"@inproceedings{\\n title = {Algoritmo Genético com Busca Local Para a Minimização do Atraso Total das Tarefas no Problema de Programação Flowshop Permutacional},\\n type = {inproceedings},\\n year = {2008},\\n pages = {1-12},\\n id = {442f6750-4432-3f50-bd7c-469ece59d084},\\n created = {2016-11-23T14:01:34.000Z},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2017-03-15T01:49:32.045Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {true},\\n hidden = {false},\\n citation_key = {Januario_EtAl_2008_cba},\\n source_type = {article},\\n private_publication = {false},\\n bibtype = {inproceedings},\\n author = {Januario, Tiago de Oliveira and Arroyo, José Elias Claudio and Moreira, Mayron César de Oliveira},\\n booktitle = {Proccedings of XVII Congresso Brasileiro de Automática}\\n}\",\"author_short\":[\"Januario,  T., d., O.\",\"Arroyo,  J., E., C.\",\"Moreira,  M., C., d., O.\"],\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"januario-arroyo-moreira-algoritmogenticocombuscalocalparaaminimizaodoatrasototaldastarefasnoproblemadeprogramaoflowshoppermutacional-2008\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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)\",\"bibtex\":\"@inbook{\\n type = {inbook},\\n year = {2009},\\n pages = {153-164},\\n websites = {http://link.springer.com/chapter/10.1007%2F978-3-642-03211-0_13},\\n publisher = {Springer Heidelberg},\\n city = {Berlin},\\n id = {889e2d67-3e70-3106-904e-bfbff847ae96},\\n created = {2016-11-23T14:01:34.000Z},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2017-03-15T01:49:32.045Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {true},\\n hidden = {false},\\n citation_key = {januario2009genetic},\\n source_type = {incollection},\\n private_publication = {false},\\n 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.},\\n bibtype = {inbook},\\n author = {Januario, Tiago de O and Arroyo, José Elias C and Moreira, Mayron César O},\\n doi = {10.1007/978-3-642-03211-0_13},\\n chapter = {Genetic Algorithm for Tardiness Minimization in Flowshop with Blocking},\\n title = {Nature Inspired Cooperative Strategies for Optimization (NICSO 2008)}\\n}\",\"author_short\":[\"Januario,  T., d., O.\",\"Arroyo,  J., E., C.\",\"Moreira,  M., C., O.\"],\"urls\":{\"Website\":\"http://link.springer.com/chapter/10.1007%2F978-3-642-03211-0_13\"},\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"januario-arroyo-moreira-natureinspiredcooperativestrategiesforoptimizationnicso2008-2009\",\"role\":\"author\",\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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\\r\\nduling  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\",\"bibtex\":\"@inproceedings{\\n title = {Um algoritmo evolutivo para o problema de Job Shop Scheduling bi-objetivo},\\n type = {inproceedings},\\n year = {2008},\\n pages = {1-12},\\n city = {Joao Pessoa},\\n id = {6d4f7188-b264-35f2-ba99-fa74056b8518},\\n created = {2016-11-23T14:01:34.000Z},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2017-03-15T01:49:32.045Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {true},\\n hidden = {false},\\n citation_key = {MoreiraEtAl_2008_sbpo},\\n source_type = {article},\\n private_publication = {false},\\n abstract = {This  article  considers  the  Job  Shop  Sche\\r\\nduling  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. },\\n bibtype = {inproceedings},\\n 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},\\n booktitle = {Anais do XL Simpósio Brasileiro de Pesquisa Operacional}\\n}\",\"author_short\":[\"Moreira,  M., C., d., O.\",\"Arroyo,  J., E., C.\",\"Januário,  T., d., O.\",\"Oliveira Júnior,  P., L.\"],\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"moreira-arroyo-janurio-oliveirajnior-umalgoritmoevolutivoparaoproblemadejobshopschedulingbiobjetivo-2008\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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\",\"bibtex\":\"@inproceedings{\\n title = {Genetic Algorithms for Bi-Objective Job Shop Scheduling Problem},\\n type = {inproceedings},\\n year = {2008},\\n pages = {720-725},\\n websites = {http://ieeexplore.ieee.org/document/4626716/?reload=true},\\n publisher = {IEEE},\\n city = {Barcelona},\\n id = {b97b56e7-bc43-3ccb-bc93-1cfbfcb15692},\\n created = {2016-11-23T14:01:34.000Z},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2017-03-15T01:49:32.045Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {true},\\n hidden = {false},\\n citation_key = {MoreiraEtAl_2008_his},\\n source_type = {article},\\n private_publication = {false},\\n 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.},\\n bibtype = {inproceedings},\\n author = {Moreira, Mayron C O and Arroyo, José E C and Januario, Tiago O and Oliveira, Paulo L},\\n doi = {10.1109/HIS.2008.43},\\n booktitle = {Proccedings of 8th International Conference on Hibrid Intelligent Systems}\\n}\",\"author_short\":[\"Moreira,  M., C., O.\",\"Arroyo,  J., E., C.\",\"Januario,  T., O.\",\"Oliveira,  P., L.\"],\"urls\":{\"Website\":\"http://ieeexplore.ieee.org/document/4626716/?reload=true\"},\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"moreira-arroyo-januario-oliveira-geneticalgorithmsforbiobjectivejobshopschedulingproblem-2008\",\"role\":\"author\",\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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\",\"bibtex\":\"@inproceedings{\\n title = {Genetic local search algorithm for the minimum total tardiness permutation flowshop problem},\\n type = {inproceedings},\\n year = {2008},\\n pages = {115-121},\\n websites = {http://ieeexplore.ieee.org/document/4625049/},\\n publisher = {IEEE},\\n city = {Sao Paulo},\\n institution = {IEEE},\\n id = {5125e63a-d4f7-3ce5-9210-14f8a1ea2f0f},\\n created = {2016-11-23T14:01:34.000Z},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2017-03-15T01:49:32.045Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {true},\\n hidden = {false},\\n citation_key = {JanuarioEtAl_2008_ieee},\\n source_type = {inproceedings},\\n private_publication = {false},\\n 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.},\\n bibtype = {inproceedings},\\n author = {Januario, Tiago de Oliveira and Arroyo, José Elias Claudio and Moreira, Mayron César de Oliveira and Kampke, Edmar Hell},\\n doi = {10.1109/CSEW.2008.12},\\n booktitle = {11th IEEE International Conference on Computational Science and Engineering}\\n}\",\"author_short\":[\"Januario,  T., d., O.\",\"Arroyo,  J., E., C.\",\"Moreira,  M., C., d., O.\",\"Kampke,  E., H.\"],\"urls\":{\"Website\":\"http://ieeexplore.ieee.org/document/4625049/\"},\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"januario-arroyo-moreira-kampke-geneticlocalsearchalgorithmfortheminimumtotaltardinesspermutationflowshopproblem-2008\",\"role\":\"author\",\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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\",\"bibtex\":\"@article{\\n title = {Optimal subdivision of land in agrarian reform projects: an analysis using genetic algorithms},\\n type = {article},\\n year = {2011},\\n keywords = {Agrarian reform,genetic algorithm,rural settlement,spatial planning},\\n pages = {169-178},\\n volume = {38},\\n websites = {http://rcia.uc.cl/index.php/rcia/article/view/111},\\n id = {db390d9c-c661-3183-9e49-e9eed1b712b5},\\n created = {2016-11-23T16:10:39.000Z},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2017-03-15T01:49:32.045Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {true},\\n hidden = {false},\\n citation_key = {FerreiraNetoEtAl_2011_cia},\\n source_type = {article},\\n private_publication = {false},\\n 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.},\\n bibtype = {article},\\n author = {Ferreira Neto, José Ambrósio and dos Santos Junior, Edgard Carneiro and Paleo, Urbano Fra and Moreira, Mayron César de Oliveira},\\n doi = {http://dx.doi.org/10.4067/rcia.v38i2.111},\\n journal = {Ciencia e Investigación Agraria}\\n}\",\"author_short\":[\"Ferreira Neto,  J., A.\",\"dos Santos Junior,  E., C.\",\"Paleo,  U., F.\",\"Moreira,  M., C., d., O.\"],\"urls\":{\"Website\":\"http://rcia.uc.cl/index.php/rcia/article/view/111\"},\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"ferreiraneto-dossantosjunior-paleo-moreira-optimalsubdivisionoflandinagrarianreformprojectsananalysisusinggeneticalgorithms-2011\",\"role\":\"author\",\"keyword\":[\"Agrarian reform\",\"genetic algorithm\",\"rural settlement\",\"spatial planning\"],\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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\",\"bibtex\":\"@article{\\n 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},\\n type = {article},\\n year = {2008},\\n volume = {IV},\\n id = {d88f5779-e1e1-3da6-8578-6b655c2ac88d},\\n created = {2016-11-23T16:10:39.000Z},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2017-03-15T01:49:32.045Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {true},\\n hidden = {false},\\n citation_key = {Januario2008},\\n private_publication = {false},\\n bibtype = {article},\\n author = {Januario, Tiago de Oliveira and Arroyo, José Elias Claudio and Moreira, Mayron César de Oliveira},\\n journal = {Revista Eletrônica de Iniciação Científica}\\n}\",\"author_short\":[\"Januario,  T., d., O.\",\"Arroyo,  J., E., C.\",\"Moreira,  M., C., d., O.\"],\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"januario-arroyo-moreira-algoritmogenticocombuscalocalparaaminimizaodoatrasototaldastarefasnoproblemadeprogramaoflowshoppermutacionalcombufferzero-2008\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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\",\"bibtex\":\"@inproceedings{\\n title = {Princípios de Cartografia Social em Diagnósticos Participativos em Projetos de Reforma Agrária},\\n type = {inproceedings},\\n year = {2010},\\n pages = {993-1002},\\n city = {Aveiro},\\n id = {c7aa00f3-441d-3347-bbe0-5d1bac6ef53d},\\n created = {2016-11-23T16:10:39.000Z},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2017-03-15T01:49:32.045Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {true},\\n hidden = {false},\\n private_publication = {false},\\n bibtype = {inproceedings},\\n author = {Milagres, C. S. F. and Ferreira Neto, J. A. and Moura, R. A. and Moreira, M. C. O.},\\n booktitle = {Anais do IV Congresso de Estudos Rurais}\\n}\",\"author_short\":[\"Milagres,  C., S., F.\",\"Ferreira Neto,  J., A.\",\"Moura,  R., A.\",\"Moreira,  M., C., O.\"],\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"milagres-ferreiraneto-moura-moreira-princpiosdecartografiasocialemdiagnsticosparticipativosemprojetosdereformaagrria-2010\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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\\r\\nare 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\",\"bibtex\":\"@inproceedings{\\n title = {Análise da eficiência de linhas de produção com trabalhadores deficientes},\\n type = {inproceedings},\\n year = {2009},\\n pages = {698-709},\\n city = {Porto Seguro},\\n id = {fd3528e9-1c12-33ae-9338-97069d80298f},\\n created = {2016-11-23T16:10:39.000Z},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2017-03-15T01:49:32.045Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {true},\\n hidden = {false},\\n private_publication = {false},\\n abstract = {People with disabilities are usually excluded from the work market. Although the reasons for this fact\\r\\nare 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.},\\n bibtype = {inproceedings},\\n author = {Costa, A. M. and Santos, L. M. R. and Moreira, M. C. O.},\\n booktitle = {Anais do XLI Simpósio Brasileiro de Pesquisa Operacional}\\n}\",\"author_short\":[\"Costa,  A., M.\",\"Santos,  L., M., R.\",\"Moreira,  M., C., O.\"],\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"costa-santos-moreira-anlisedaeficinciadelinhasdeproduocomtrabalhadoresdeficientes-2009\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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.\",\"bibtex\":\"@book{\\n title = {Terraço 4.1 - Práticas mecânicas para a conservação de solo e água em áreas agrícolas},\\n type = {book},\\n year = {2009},\\n pages = {88},\\n publisher = {AEAGRI},\\n city = {Viçosa},\\n edition = {1},\\n id = {0d912076-0e08-3a8a-8957-f520a52a8c49},\\n created = {2017-01-03T19:02:15.000Z},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2017-03-15T01:49:32.045Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {false},\\n hidden = {false},\\n private_publication = {false},\\n bibtype = {book},\\n 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.}\\n}\",\"author_short\":[\"Pruski,  F., P.\",\"Moreira,  G., T., G.\",\"Silva,  J., M., A.\",\"Oliveira,  C., P., F.\",\"Moreira,  M., C., O.\",\"Griebeler,  N., P.\",\"Andrade,  M., V., A.\",\"Teixeira,  A., F.\"],\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"pruski-moreira-silva-oliveira-moreira-griebeler-andrade-teixeira-terrao41prticasmecnicasparaaconservaodesoloeguaemreasagrcolas-2009\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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\",\"bibtex\":\"@inbook{\\n type = {inbook},\\n year = {2011},\\n pages = {265-272},\\n publisher = {Suprema},\\n city = {Visconde do rio Branco},\\n edition = {1},\\n id = {f4717537-8269-36fc-a9de-e338cf512860},\\n created = {2017-01-03T19:05:58.000Z},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2017-03-15T01:49:32.045Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {false},\\n hidden = {false},\\n citation_key = {Moreira2011},\\n private_publication = {false},\\n bibtype = {inbook},\\n author = {Moreira, M. C. O. and Ferreira Neto, J. A. and Einloft, C. J. and Silva, N. T. C.},\\n editor = {José Ambrósio Ferreira Neto Carlos Joaquim Einloft, undefined and Renato Luiz Gonçalves, undefined},\\n 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)},\\n title = {Desenvolvimento Rural, sustentabilidade e ordenamento territorial}\\n}\",\"author_short\":[\"Moreira,  M., C., O.\",\"Ferreira Neto,  J., A.\",\"Einloft,  C., J.\",\"Silva,  N., T., C.\"],\"editor_short\":[\"José Ambrósio Ferreira Neto Carlos Joaquim Einloft\",\"Renato Luiz Gonçalves\"],\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"moreira-ferreiraneto-einloft-silva-desenvolvimentoruralsustentabilidadeeordenamentoterritorial-2011\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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\",\"bibtex\":\"@inbook{\\n type = {inbook},\\n year = {2010},\\n pages = {238-248},\\n publisher = {Suprema},\\n city = {Visconde do Rio Branco},\\n edition = {1},\\n id = {2535afb7-7b87-3131-a79e-f5f39e95a630},\\n created = {2017-01-03T19:08:10.000Z},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2017-03-15T01:49:32.045Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {false},\\n hidden = {false},\\n citation_key = {FerreiraNeto2010},\\n private_publication = {false},\\n bibtype = {inbook},\\n author = {Ferreira Neto, J. A. and Milagres, C. S. F. and Sousa, D. N. and Moreira, M. C. O.},\\n editor = {José Ambrósio Ferreira Neto Diego Neves de Souza, undefined and Cleiton Silva Ferreira Milagres, undefined},\\n chapter = {O uso do aplicativo SOTER e da cartografia social na organização territorial em projetos de reforma agrária},\\n title = {Recursos Naturais, Sistemas de Informação Geográfica e Processos Sociais}\\n}\",\"author_short\":[\"Ferreira Neto,  J., A.\",\"Milagres,  C., S., F.\",\"Sousa,  D., N.\",\"Moreira,  M., C., O.\"],\"editor_short\":[\"José Ambrósio Ferreira Neto Diego Neves de Souza\",\"Cleiton Silva Ferreira Milagres\"],\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"ferreiraneto-milagres-sousa-moreira-recursosnaturaissistemasdeinformaogeogrficaeprocessossociais-2010\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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\",\"bibtex\":\"@article{\\n title = {The multi-objective assembly line worker integration and balancing problem of type-2},\\n type = {article},\\n year = {2017},\\n pages = {114-125},\\n volume = {82},\\n websites = {http://www.sciencedirect.com/science/article/pii/S0305054817300059},\\n id = {b9e74cf8-6361-3bf8-9f3e-6bb00ab977fb},\\n created = {2017-02-07T15:33:25.000Z},\\n accessed = {2017-02-07},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2017-03-15T01:49:32.045Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {false},\\n hidden = {false},\\n private_publication = {false},\\n 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.},\\n bibtype = {article},\\n author = {Moreira, Mayron César O. and Pastor, Rafael and Costa, Alysson M. and Miralles, Cristóbal},\\n doi = {10.1016/j.cor.2017.01.003},\\n journal = {Computers & Operations Research}\\n}\",\"author_short\":[\"Moreira,  M., C., O.\",\"Pastor,  R.\",\"Costa,  A., M.\",\"Miralles,  C.\"],\"urls\":{\"Website\":\"http://www.sciencedirect.com/science/article/pii/S0305054817300059\"},\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"moreira-pastor-costa-miralles-themultiobjectiveassemblylineworkerintegrationandbalancingproblemoftype2-2017\",\"role\":\"author\",\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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\",\"bibtex\":\"@inproceedings{\\n title = {A genetic algorithm for fair land allocation},\\n type = {inproceedings},\\n year = {2017},\\n keywords = {Gliesch_etal_2017},\\n pages = {793-800},\\n websites = {https://dl.acm.org/citation.cfm?id=3071313},\\n publisher = {ACM},\\n city = {Berlin},\\n id = {6f3e81e6-984f-3007-b3dc-132703cad5b1},\\n created = {2017-03-20T21:59:57.875Z},\\n file_attached = {true},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2020-05-08T18:20:09.690Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {true},\\n hidden = {false},\\n folder_uuids = {418968d6-a37c-409b-ad84-786ed498ab5f},\\n private_publication = {false},\\n 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.},\\n bibtype = {inproceedings},\\n author = {Gliesch, A. and Ritt, M. and Moreira, M. C. O.},\\n doi = {10.1145/3071178.3071313},\\n booktitle = {Proceedings of the Genetic and Evolutionary Computation Conference}\\n}\",\"author_short\":[\"Gliesch,  A.\",\"Ritt,  M.\",\"Moreira,  M., C., O.\"],\"urls\":{\"Paper\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8/file/298ddbe4-284c-294d-2046-ed84d0afe51a/Gliesch_etal_2017.pdf.pdf\",\"Website\":\"https://dl.acm.org/citation.cfm?id=3071313\"},\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"gliesch-ritt-moreira-ageneticalgorithmforfairlandallocation-2017\",\"role\":\"author\",\"keyword\":[\"Gliesch_etal_2017\"],\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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\",\"bibtex\":\"@inproceedings{\\n title = {A Multistart Alternating Tabu Search for Commercial Districting},\\n type = {inproceedings},\\n year = {2018},\\n pages = {158-173},\\n websites = {https://link.springer.com/chapter/10.1007/978-3-319-77449-7_11},\\n publisher = {Springer Nature},\\n city = {Parma},\\n id = {b472e1b0-5fe9-3adc-8897-8adff73db82d},\\n created = {2018-02-21T21:44:39.960Z},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2018-10-06T22:33:47.073Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {true},\\n hidden = {false},\\n private_publication = {false},\\n 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.},\\n bibtype = {inproceedings},\\n author = {Gliesch, A. and Ritt, M. and Moreira, M. C. O.},\\n editor = {Liefooghe, A. and López-Ibáñez, M.},\\n booktitle = {Annals of Evolutionary Computation in Combinatorial Optimization}\\n}\",\"author_short\":[\"Gliesch,  A.\",\"Ritt,  M.\",\"Moreira,  M., C., O.\"],\"editor_short\":[\"Liefooghe,  A.\",\"López-Ibáñez,  M.\"],\"urls\":{\"Website\":\"https://link.springer.com/chapter/10.1007/978-3-319-77449-7_11\"},\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"gliesch-ritt-moreira-amultistartalternatingtabusearchforcommercialdistricting-2018\",\"role\":\"author\",\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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\",\"bibtex\":\"@inproceedings{\\n title = {Modelo Matemático e Heurísticas para o Problema de Balanceamento de Linhas de Produção e Designação Hierárquica de Trabalhadores},\\n type = {inproceedings},\\n year = {2018},\\n pages = {1-8},\\n city = {Rio de Janeiro},\\n id = {e0304709-0067-3282-83a5-15967c1b4c06},\\n created = {2018-10-06T22:31:00.597Z},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2018-10-06T22:36:42.072Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {false},\\n hidden = {false},\\n private_publication = {false},\\n 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.},\\n bibtype = {inproceedings},\\n author = {Campana, N. P. and Moreira, M. C. O.},\\n booktitle = {Anais do 50 Simpósio Brasileiro de Pesquisa Operacional}\\n}\",\"author_short\":[\"Campana,  N., P.\",\"Moreira,  M., C., O.\"],\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"campana-moreira-modelomatemticoeheursticasparaoproblemadebalanceamentodelinhasdeproduoedesignaohierrquicadetrabalhadores-2018\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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\",\"bibtex\":\"@inproceedings{\\n title = {Solution of a Practical Pallet Building Problem with Visibility and Contiguity Constraints},\\n type = {inproceedings},\\n year = {2020},\\n pages = {327-338},\\n websites = {https://www.scitepress.org/Papers/2020/93517/93517.pdf},\\n month = {5},\\n publisher = {Scitepress},\\n day = {18},\\n city = {Prague},\\n id = {124616b2-3649-3438-a464-0cea1378a107},\\n created = {2020-06-28T20:45:53.663Z},\\n file_attached = {true},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2021-04-20T14:46:39.899Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {false},\\n hidden = {false},\\n citation_key = {Iori.EtAl/2020icores},\\n private_publication = {false},\\n bibtype = {inproceedings},\\n author = {Iori, Manuel and Locatelli, Marco and Moreira, M. C. O. and Silveira, Tiago},\\n doi = {10.5220/0009351703270338},\\n booktitle = {22nd International Conference on Enterprise Information Systems}\\n}\",\"author_short\":[\"Iori,  M.\",\"Locatelli,  M.\",\"Moreira,  M., C., O.\",\"Silveira,  T.\"],\"urls\":{\"Paper\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8/file/36142ac0-8ee0-0793-0767-294d04f6fdde/ICEIS_2020_55.pdf.pdf\",\"Website\":\"https://www.scitepress.org/Papers/2020/93517/93517.pdf\"},\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"iori-locatelli-moreira-silveira-solutionofapracticalpalletbuildingproblemwithvisibilityandcontiguityconstraints-2020\",\"role\":\"author\",\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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\",\"bibtex\":\"@inproceedings{\\n title = {On solving the time window assignment vehicle routing problem via iterated local search},\\n type = {inproceedings},\\n year = {2020},\\n pages = {1-12},\\n websites = {https://link.springer.com/book/10.1007%2F978-3-030-63072-0},\\n city = {Ischia},\\n id = {cdd9d069-4185-32b3-8ee6-c96a48061fe5},\\n created = {2020-06-28T20:50:02.724Z},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2021-04-20T14:46:40.106Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {false},\\n hidden = {false},\\n citation_key = {Burahem.EtAl/2020},\\n private_publication = {false},\\n bibtype = {inproceedings},\\n author = {Martins, L. B. and Iori, M. and Moreira, M. C. O. and Zucchi, G.},\\n booktitle = {18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization}\\n}\",\"author_short\":[\"Martins,  L., B.\",\"Iori,  M.\",\"Moreira,  M., C., O.\",\"Zucchi,  G.\"],\"urls\":{\"Website\":\"https://link.springer.com/book/10.1007%2F978-3-030-63072-0\"},\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"martins-iori-moreira-zucchi-onsolvingthetimewindowassignmentvehicleroutingproblemviaiteratedlocalsearch-2020\",\"role\":\"author\",\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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\",\"bibtex\":\"@inproceedings{\\n title = {A hybrid heuristic for districting problems with routing criteria},\\n type = {inproceedings},\\n year = {2020},\\n pages = {1-8},\\n websites = {https://ieeexplore.ieee.org/document/9185863},\\n city = {Glasgow},\\n id = {5ccadc82-d265-3017-a9dd-e53dec6c989e},\\n created = {2020-06-28T20:52:14.960Z},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2021-04-20T14:46:39.788Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {false},\\n hidden = {false},\\n citation_key = {Gliesh.EtAl/2020routing},\\n private_publication = {false},\\n bibtype = {inproceedings},\\n author = {Gliesch, A. and Ritt, M. and Cruz, A. H. S. and Moreira, M. C. O.},\\n booktitle = {Annals of IEEE WORLD CONGRESS ON COMPUTATIONAL INTELLIGENCE (WCCI) 2020}\\n}\",\"author_short\":[\"Gliesch,  A.\",\"Ritt,  M.\",\"Cruz,  A., H., S.\",\"Moreira,  M., C., O.\"],\"urls\":{\"Website\":\"https://ieeexplore.ieee.org/document/9185863\"},\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"gliesch-ritt-cruz-moreira-ahybridheuristicfordistrictingproblemswithroutingcriteria-2020\",\"role\":\"author\",\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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\",\"bibtex\":\"@inproceedings{\\n title = {A heuristic algorithm for districting problems with similarity constraints},\\n type = {inproceedings},\\n year = {2020},\\n pages = {1-8},\\n websites = {https://ieeexplore.ieee.org/document/9185552},\\n city = {Glasgow},\\n id = {62ad6e3a-25ea-30ea-a74e-b5e8017d7413},\\n created = {2020-06-28T20:53:39.095Z},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2021-04-20T14:46:39.752Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {false},\\n hidden = {false},\\n citation_key = {Gliesch.EtAl/2020similarity},\\n private_publication = {false},\\n bibtype = {inproceedings},\\n author = {Gliesch, A. and Ritt, M. and Cruz, A. H. S. and Moreira, M. C. O.},\\n booktitle = {Annals of IEEE WORLD CONGRESS ON COMPUTATIONAL INTELLIGENCE (WCCI) 2020}\\n}\",\"author_short\":[\"Gliesch,  A.\",\"Ritt,  M.\",\"Cruz,  A., H., S.\",\"Moreira,  M., C., O.\"],\"urls\":{\"Website\":\"https://ieeexplore.ieee.org/document/9185552\"},\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"gliesch-ritt-cruz-moreira-aheuristicalgorithmfordistrictingproblemswithsimilarityconstraints-2020\",\"role\":\"author\",\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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\",\"bibtex\":\"@article{\\n title = {A Multiperiod Workforce Scheduling and Routing Problem with Dependent Tasks},\\n type = {article},\\n year = {2020},\\n pages = {104930},\\n volume = {118},\\n websites = {https://www.sciencedirect.com/science/article/abs/pii/S0305054820300472},\\n id = {761a0d15-69df-3ba8-9711-d7f34907247e},\\n created = {2020-06-28T20:55:38.260Z},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2021-04-20T14:46:40.044Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {false},\\n hidden = {false},\\n citation_key = {Pereira.EtAl/2020},\\n private_publication = {false},\\n bibtype = {article},\\n author = {Pereira, D. L. and Alves, J. C. and Moreira, M. C. O.},\\n doi = {10.1016/j.cor.2020.104930},\\n journal = {Computers & Operations Research}\\n}\",\"author_short\":[\"Pereira,  D., L.\",\"Alves,  J., C.\",\"Moreira,  M., C., O.\"],\"urls\":{\"Website\":\"https://www.sciencedirect.com/science/article/abs/pii/S0305054820300472\"},\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"pereira-alves-moreira-amultiperiodworkforceschedulingandroutingproblemwithdependenttasks-2020\",\"role\":\"author\",\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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\",\"bibtex\":\"@inproceedings{\\n title = {Reactive GRASP-based Algorithm for Pallet Building Problem with Visibility and Contiguity Constraints},\\n type = {inproceedings},\\n year = {2020},\\n pages = {651-665},\\n websites = {https://link.springer.com/chapter/10.1007/978-3-030-59747-4_42},\\n city = {Enschede},\\n id = {ed82774e-2f85-3223-a477-defc82d47231},\\n created = {2021-04-20T14:37:35.268Z},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2021-04-20T14:37:35.268Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {true},\\n hidden = {false},\\n citation_key = {Iori.EtAl/2020},\\n private_publication = {false},\\n bibtype = {inproceedings},\\n author = {Iori, Manuel and Locatelli, Marco and Moreira, Mayron César de Oliveira and Silveira, Tiago},\\n booktitle = {International Conference on Computational Logistics}\\n}\",\"author_short\":[\"Iori,  M.\",\"Locatelli,  M.\",\"Moreira,  M., C., d., O.\",\"Silveira,  T.\"],\"urls\":{\"Website\":\"https://link.springer.com/chapter/10.1007/978-3-030-59747-4_42\"},\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"iori-locatelli-moreira-silveira-reactivegraspbasedalgorithmforpalletbuildingproblemwithvisibilityandcontiguityconstraints-2020\",\"role\":\"author\",\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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\",\"bibtex\":\"@inproceedings{\\n title = {Nesting problems with continuous rotations: a survey},\\n type = {inproceedings},\\n year = {2020},\\n pages = {1-12},\\n websites = {https://proceedings.science/sbpo-2020/papers/nesting-problems-with-continuous-rotations--a-survey},\\n city = {João Pessoa},\\n id = {e8d7a7b4-e329-3236-9c9a-15873e4fc66b},\\n created = {2021-04-20T14:37:35.300Z},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2021-04-20T14:37:35.300Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {true},\\n hidden = {false},\\n citation_key = {Ferreira.EtAl/2020},\\n private_publication = {false},\\n bibtype = {inproceedings},\\n author = {Ferreira, A. S. and Moreira, M. C. O. and Andretta, M.},\\n booktitle = {LII Simpósio Brasileiro de Pesquisa Operacional}\\n}\",\"author_short\":[\"Ferreira,  A., S.\",\"Moreira,  M., C., O.\",\"Andretta,  M.\"],\"urls\":{\"Website\":\"https://proceedings.science/sbpo-2020/papers/nesting-problems-with-continuous-rotations--a-survey\"},\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"ferreira-moreira-andretta-nestingproblemswithcontinuousrotationsasurvey-2020\",\"role\":\"author\",\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"},{\"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\",\"bibtex\":\"@article{\\n title = {Mathematical models and heuristic methods for the assembly line balancing problem with hierarchical worker assignment},\\n type = {article},\\n year = {2021},\\n pages = {1-19},\\n websites = {https://www.tandfonline.com/doi/abs/10.1080/00207543.2021.1884767},\\n id = {f2e17fd5-fa6a-3e9b-8c8a-3802ffbd6b43},\\n created = {2021-04-20T19:56:41.698Z},\\n file_attached = {false},\\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\\n last_modified = {2021-04-20T19:56:41.698Z},\\n read = {false},\\n starred = {false},\\n authored = {true},\\n confirmed = {true},\\n hidden = {false},\\n citation_key = {Campana.EtAl/2021},\\n private_publication = {false},\\n bibtype = {article},\\n author = {Campana, Nícolas Porto and Iori, Manuel and Moreira, Mayron César de Oliveira},\\n journal = {International Journal of Production Research}\\n}\",\"author_short\":[\"Campana,  N., P.\",\"Iori,  M.\",\"Moreira,  M., C., d., O.\"],\"urls\":{\"Website\":\"https://www.tandfonline.com/doi/abs/10.1080/00207543.2021.1884767\"},\"biburl\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\",\"bibbaseid\":\"campana-iori-moreira-mathematicalmodelsandheuristicmethodsfortheassemblylinebalancingproblemwithhierarchicalworkerassignment-2021\",\"role\":\"author\",\"metadata\":{\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\"downloads\":0,\"html\":\"\"}],\n      metadata: {\"owner\":\"moreira,  m\",\"authorlinks\":{\"moreira,  m\":\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\"}},\n      ownerID: \"oLj47NmD5ytC48sS7\"\n    };\n  </script>\n\n  <script type=\"text/javascript\">\n  var site$;\n  if (typeof $ != 'undefined') {\n    console.log('existing jquery: storing and then restoring');\n    site$ = $;\n    $ = null;\n  }\n  </script>\n\n  <script src=\"https://ajax.googleapis.com/ajax/libs/jquery/2.2.4/jquery.min.js\">\n  </script>\n  <script type=\"text/javascript\">\n  if (site$) {\n    console.log('existing jquery: avoiding conflict and restoring');\n    bb$ = $.noConflict(true);\n    $ = site$;\n  } else {\n    bb$ = $;\n  }\n  </script>\n\n  <script src=\"//bibbase.org/js/bibbase.min.js\"\n          type=\"text/javascript\">\n  </script>\n\n  <script type=\"text/javascript\"\n          src=\"https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML\">\n  </script>\n  <script type=\"text/x-mathjax-config\">\n    MathJax.Hub.Config({tex2jax: {inlineMath: [['$','$'], ['\\\\(','\\\\)']]},\n                        skipTags: [\"body\"],\n                        processClass: \"bibbase_paper\"});\n  </script>\n\n  <style>\n  @media print {\n    .dontprint {\n        display: none !important;\n    }\n\n  .bibbase_group {\n    background-color: #E0E0E0;\n    font-style: italic;\n    font-size: larger;\n    text-shadow: 0px 0px 3px #FFFFFF;\n    border-radius: 4px 4px 4px 4px;\n    -moz-border-radius: 4px 4px 4px 4px;\n    -webkit-border-radius: 4px;\n    padding: 5px 40px 5px;\n    margin-top: 10px;\n    margin-bottom: 5px;\n    cursor: pointer;\n  }\n\n  .bibbase_paper {\n    margin-bottom: 5px;\n  }\n\n  }\n  </style>\n\n  \n  <div style=\"float: right; margin-right: 10px; margin-top: 10px; text-align: right; font-size: 12px\">\n    generated by\n    <a href=\"//bibbase.org\"\n       onclick=\"trackOutboundLink('bibbase', 'logo clicked', window.location.href, '//bibbase.org'); return false;\">\n      <img src=\"//bibbase.org/img/logo.svg\"\n           style=\"vertical-align: middle; margin-left: 3px; height: 16px;\"/\n           alt=\"bibbase.org\"\n           title=\"BibBase – The easiest way to maintain your publications page.\"\n        ></a>\n    \n  </div>\n  \n\n  <div id=\"bibbase_header\" class=\"dontprint\" style=\"\">\n\n    <ul class=\"nav nav-pills\" style=\"margin: 0px;\">\n\n      <li class=\"dropdown\" id=\"groupby_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\">\n          Group by\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li class=\"groupby year\"><a onclick=\"groupby('year')\">\n            Year</a>\n        </li>\n        <li class=\"groupby author\"><a onclick=\"groupby('author_short')\">\n            Author</a>\n        </li>\n        <li class=\"groupby type\"><a onclick=\"groupby('type')\">\n            Type</a>\n        </li>\n        <li class=\"groupby keyword\"><a onclick=\"groupby('keyword')\">\n            Keyword</a>\n        </li>\n        <li class=\"groupby downloads\"><a onclick=\"groupby('downloads')\">\n            Downloads</a>\n        </li>\n      </ul>\n      </li>\n\n\n      <li class=\"dropdown\" id=\"menu_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\" alt=\"controls\">\n          <i class=\"fa fa-reorder\" alt=\"controls\"></i>\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li>\n          <a onclick=\"toggleAll()\">\n            <i class=\"fa fa-chevron-down fa-fw\"></i> Expand/Collapse All\n          </a>\n        </li>\n        <li>\n          <a download=\"all.bib\" href=\"data:text/bibtex;base64,@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}
}

@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}
}

@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}
}

@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}
}

@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}
}

@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}
}

@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}
}

@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}
}

@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}
}

@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)}
}

@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}
}

@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}
}

@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}
}

@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}
}

@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}
}

@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}
}

@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}
}

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

@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}
}

@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}
}

@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}
}

@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}
}

@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}
}

@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}
}

@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}
}

@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}
}\">\n            <i class=\"fa fa-download fa-fw\"></i> Download BibTeX\n          </a>\n        </li>\n        <li>\n          <a href=\"//bibbase.org/rss?bib=\">\n            <i class=\"fa fa-rss fa-fw\"></i> RSS Feed\n          </a>\n          </li>\n      </ul>\n      </li>\n\n      \n\n\n      \n    </ul>\n\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_embed\"\n         style=\"display: none;\">\n\n      Excellent! Next you can\n      <a href=\"/network/register?next=/network/newSiteFromTemplate%3Fbiburl=\"\n      >create a new website with this list</a>, or\n      embed it in an existing web page by copying &amp; pasting\n      any of the following snippets.\n\n      <div style=\"text-align: left; margin-top: 1em;\">\n        <strong>JavaScript</strong>\n        <span class=\"comment recommended\">(easiest)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;script src=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8?jsonp=1&amp;jsonp=1\"&gt;&lt;/script&gt;\n          </code>\n        </div>\n\n        <strong>PHP</strong>\n        <div class=\"well well-small\">\n          <code>\n            &lt;?php\n            $contents = file_get_contents(\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8?jsonp=1\");\n            print_r($contents);\n            ?&gt;\n          </code>\n        </div>\n\n        <strong>iFrame</strong>\n        <span class=\"comment\">(not recommended)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;iframe src=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8?jsonp=1\"&gt;&lt;/iframe&gt;\n          </code>\n        </div>\n\n        <p>\n          For more details see the <a href=\"//bibbase.org/help\">documention</a>.\n        </p>\n      </div>\n    </div>\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_preview\"\n         style=\"display: none;\">\n\n      This is a preview! To use this list on your own web site\n      or create a new web site from it,\n      <a href=\"/network/register?next=/network/newAccountWithFile%3FfileId=\"\n      >create a free account</a>. The file will be added\n      and you will be able to edit it in the File Manager.\n      We will show you instructions once you've created your account.\n    </div>\n\n    <div class=\"alert alert-warning bibbase_msg\" id=\"bibbase_msg_mendeley1\"\n         style=\"display: none;\">\n\n      <p>To the site owner:</p>\n\n      <p><strong>Action required!</strong> Mendeley is changing its\n        API. In order to keep using Mendeley with BibBase past April\n        14th, you need to:\n        <ol>\n          <li>renew the authorization for BibBase on Mendeley, and</li>\n          <li>update the BibBase URL\n            in your page the same way you did when you initially set up\n            this page.\n          </li>\n        </ol>\n      </p>\n\n      <p>\n        <a href=\"http://bibbase.org/cgi-bin/mendeley2/get.py\">\n          <i class=\"fa fa-angle-double-right\"></i>\n          Fix it now</a>\n      </p>\n    </div>\n\n  </div>\n\n\n  <div id=\"bibbase_body\">\n    \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2021\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2021')\"\n      onkeypress=\"toggleGroup('group_2021')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2021</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"campana-iori-moreira-mathematicalmodelsandheuristicmethodsfortheassemblylinebalancingproblemwithhierarchicalworkerassignment-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.tandfonline.com/doi/abs/10.1080/00207543.2021.1884767\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'campana-iori-moreira-mathematicalmodelsandheuristicmethodsfortheassemblylinebalancingproblemwithhierarchicalworkerassignment-2021', 'https://www.tandfonline.com/doi/abs/10.1080/00207543.2021.1884767', event);\">\n    Mathematical models and heuristic methods for the assembly line balancing problem with hierarchical worker assignment.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Campana,  N., P.; Iori,  M.;  and <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., d., O.</a>\n</span>\n\n  \n\n</span>\n\n  <i>International Journal of Production Research</i>,1-19.  2021.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.tandfonline.com/doi/abs/10.1080/00207543.2021.1884767\"\n     onclick=\"log_download('campana-iori-moreira-mathematicalmodelsandheuristicmethodsfortheassemblylinebalancingproblemwithhierarchicalworkerassignment-2021', 'https://www.tandfonline.com/doi/abs/10.1080/00207543.2021.1884767', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Mathematical models and heuristic methods for the assembly line balancing problem with hierarchical worker assignment [link]\"\n       title=\"Website\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Website</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/campana-iori-moreira-mathematicalmodelsandheuristicmethodsfortheassemblylinebalancingproblemwithhierarchicalworkerassignment-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('campana-iori-moreira-mathematicalmodelsandheuristicmethodsfortheassemblylinebalancingproblemwithhierarchicalworkerassignment-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{\n title = {Mathematical models and heuristic methods for the assembly line balancing problem with hierarchical worker assignment},\n type = {article},\n year = {2021},\n pages = {1-19},\n websites = {https://www.tandfonline.com/doi/abs/10.1080/00207543.2021.1884767},\n id = {f2e17fd5-fa6a-3e9b-8c8a-3802ffbd6b43},\n created = {2021-04-20T19:56:41.698Z},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2021-04-20T19:56:41.698Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n citation_key = {Campana.EtAl/2021},\n private_publication = {false},\n bibtype = {article},\n author = {Campana, Nícolas Porto and Iori, Manuel and Moreira, Mayron César de Oliveira},\n journal = {International Journal of Production Research}\n}</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2020\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2020')\"\n      onkeypress=\"toggleGroup('group_2020')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2020</span>\n      <span class=\"bibbase_group_count\">\n        \n        (7)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"iori-locatelli-moreira-silveira-solutionofapracticalpalletbuildingproblemwithvisibilityandcontiguityconstraints-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8/file/36142ac0-8ee0-0793-0767-294d04f6fdde/ICEIS_2020_55.pdf.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'iori-locatelli-moreira-silveira-solutionofapracticalpalletbuildingproblemwithvisibilityandcontiguityconstraints-2020', 'https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8/file/36142ac0-8ee0-0793-0767-294d04f6fdde/ICEIS_2020_55.pdf.pdf', event);\">\n    Solution of a Practical Pallet Building Problem with Visibility and Contiguity Constraints.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Iori,  M.; Locatelli,  M.; <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., O.</a>;  and Silveira,  T.\n</span>\n\n  \n\n</span>\n\n  In <i>22nd International Conference on Enterprise Information Systems</i>, pages 327-338, 5 2020. Scitepress\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8/file/36142ac0-8ee0-0793-0767-294d04f6fdde/ICEIS_2020_55.pdf.pdf\"\n     onclick=\"log_download('iori-locatelli-moreira-silveira-solutionofapracticalpalletbuildingproblemwithvisibilityandcontiguityconstraints-2020', 'https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8/file/36142ac0-8ee0-0793-0767-294d04f6fdde/ICEIS_2020_55.pdf.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Solution of a Practical Pallet Building Problem with Visibility and Contiguity Constraints [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://www.scitepress.org/Papers/2020/93517/93517.pdf\"\n     onclick=\"log_download('iori-locatelli-moreira-silveira-solutionofapracticalpalletbuildingproblemwithvisibilityandcontiguityconstraints-2020', 'https://www.scitepress.org/Papers/2020/93517/93517.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Solution of a Practical Pallet Building Problem with Visibility and Contiguity Constraints [pdf]\"\n       title=\"Website\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Website</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.5220/0009351703270338\"\n     onclick=\"log_download('iori-locatelli-moreira-silveira-solutionofapracticalpalletbuildingproblemwithvisibilityandcontiguityconstraints-2020', 'http://doi.org/10.5220/0009351703270338', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/iori-locatelli-moreira-silveira-solutionofapracticalpalletbuildingproblemwithvisibilityandcontiguityconstraints-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('iori-locatelli-moreira-silveira-solutionofapracticalpalletbuildingproblemwithvisibilityandcontiguityconstraints-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{\n title = {Solution of a Practical Pallet Building Problem with Visibility and Contiguity Constraints},\n type = {inproceedings},\n year = {2020},\n pages = {327-338},\n websites = {https://www.scitepress.org/Papers/2020/93517/93517.pdf},\n month = {5},\n publisher = {Scitepress},\n day = {18},\n city = {Prague},\n id = {124616b2-3649-3438-a464-0cea1378a107},\n created = {2020-06-28T20:45:53.663Z},\n file_attached = {true},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2021-04-20T14:46:39.899Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {false},\n hidden = {false},\n citation_key = {Iori.EtAl/2020icores},\n private_publication = {false},\n bibtype = {inproceedings},\n author = {Iori, Manuel and Locatelli, Marco and Moreira, M. C. O. and Silveira, Tiago},\n doi = {10.5220/0009351703270338},\n booktitle = {22nd International Conference on Enterprise Information Systems}\n}</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"martins-iori-moreira-zucchi-onsolvingthetimewindowassignmentvehicleroutingproblemviaiteratedlocalsearch-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://link.springer.com/book/10.1007%2F978-3-030-63072-0\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'martins-iori-moreira-zucchi-onsolvingthetimewindowassignmentvehicleroutingproblemviaiteratedlocalsearch-2020', 'https://link.springer.com/book/10.1007%2F978-3-030-63072-0', event);\">\n    On solving the time window assignment vehicle routing problem via iterated local search.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Martins,  L., B.; Iori,  M.; <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., O.</a>;  and Zucchi,  G.\n</span>\n\n  \n\n</span>\n\n  In <i>18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization</i>, pages 1-12,  2020. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://link.springer.com/book/10.1007%2F978-3-030-63072-0\"\n     onclick=\"log_download('martins-iori-moreira-zucchi-onsolvingthetimewindowassignmentvehicleroutingproblemviaiteratedlocalsearch-2020', 'https://link.springer.com/book/10.1007%2F978-3-030-63072-0', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"On solving the time window assignment vehicle routing problem via iterated local search [link]\"\n       title=\"Website\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Website</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/martins-iori-moreira-zucchi-onsolvingthetimewindowassignmentvehicleroutingproblemviaiteratedlocalsearch-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('martins-iori-moreira-zucchi-onsolvingthetimewindowassignmentvehicleroutingproblemviaiteratedlocalsearch-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{\n title = {On solving the time window assignment vehicle routing problem via iterated local search},\n type = {inproceedings},\n year = {2020},\n pages = {1-12},\n websites = {https://link.springer.com/book/10.1007%2F978-3-030-63072-0},\n city = {Ischia},\n id = {cdd9d069-4185-32b3-8ee6-c96a48061fe5},\n created = {2020-06-28T20:50:02.724Z},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2021-04-20T14:46:40.106Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {false},\n hidden = {false},\n citation_key = {Burahem.EtAl/2020},\n private_publication = {false},\n bibtype = {inproceedings},\n author = {Martins, L. B. and Iori, M. and Moreira, M. C. O. and Zucchi, G.},\n booktitle = {18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization}\n}</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"gliesch-ritt-cruz-moreira-ahybridheuristicfordistrictingproblemswithroutingcriteria-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://ieeexplore.ieee.org/document/9185863\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'gliesch-ritt-cruz-moreira-ahybridheuristicfordistrictingproblemswithroutingcriteria-2020', 'https://ieeexplore.ieee.org/document/9185863', event);\">\n    A hybrid heuristic for districting problems with routing criteria.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Gliesch,  A.; Ritt,  M.; Cruz,  A., H., S.;  and <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., O.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>Annals of IEEE WORLD CONGRESS ON COMPUTATIONAL INTELLIGENCE (WCCI) 2020</i>, pages 1-8,  2020. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://ieeexplore.ieee.org/document/9185863\"\n     onclick=\"log_download('gliesch-ritt-cruz-moreira-ahybridheuristicfordistrictingproblemswithroutingcriteria-2020', 'https://ieeexplore.ieee.org/document/9185863', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"A hybrid heuristic for districting problems with routing criteria [link]\"\n       title=\"Website\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Website</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gliesch-ritt-cruz-moreira-ahybridheuristicfordistrictingproblemswithroutingcriteria-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gliesch-ritt-cruz-moreira-ahybridheuristicfordistrictingproblemswithroutingcriteria-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{\n title = {A hybrid heuristic for districting problems with routing criteria},\n type = {inproceedings},\n year = {2020},\n pages = {1-8},\n websites = {https://ieeexplore.ieee.org/document/9185863},\n city = {Glasgow},\n id = {5ccadc82-d265-3017-a9dd-e53dec6c989e},\n created = {2020-06-28T20:52:14.960Z},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2021-04-20T14:46:39.788Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {false},\n hidden = {false},\n citation_key = {Gliesh.EtAl/2020routing},\n private_publication = {false},\n bibtype = {inproceedings},\n author = {Gliesch, A. and Ritt, M. and Cruz, A. H. S. and Moreira, M. C. O.},\n booktitle = {Annals of IEEE WORLD CONGRESS ON COMPUTATIONAL INTELLIGENCE (WCCI) 2020}\n}</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"gliesch-ritt-cruz-moreira-aheuristicalgorithmfordistrictingproblemswithsimilarityconstraints-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://ieeexplore.ieee.org/document/9185552\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'gliesch-ritt-cruz-moreira-aheuristicalgorithmfordistrictingproblemswithsimilarityconstraints-2020', 'https://ieeexplore.ieee.org/document/9185552', event);\">\n    A heuristic algorithm for districting problems with similarity constraints.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Gliesch,  A.; Ritt,  M.; Cruz,  A., H., S.;  and <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., O.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>Annals of IEEE WORLD CONGRESS ON COMPUTATIONAL INTELLIGENCE (WCCI) 2020</i>, pages 1-8,  2020. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://ieeexplore.ieee.org/document/9185552\"\n     onclick=\"log_download('gliesch-ritt-cruz-moreira-aheuristicalgorithmfordistrictingproblemswithsimilarityconstraints-2020', 'https://ieeexplore.ieee.org/document/9185552', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"A heuristic algorithm for districting problems with similarity constraints [link]\"\n       title=\"Website\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Website</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gliesch-ritt-cruz-moreira-aheuristicalgorithmfordistrictingproblemswithsimilarityconstraints-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gliesch-ritt-cruz-moreira-aheuristicalgorithmfordistrictingproblemswithsimilarityconstraints-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{\n title = {A heuristic algorithm for districting problems with similarity constraints},\n type = {inproceedings},\n year = {2020},\n pages = {1-8},\n websites = {https://ieeexplore.ieee.org/document/9185552},\n city = {Glasgow},\n id = {62ad6e3a-25ea-30ea-a74e-b5e8017d7413},\n created = {2020-06-28T20:53:39.095Z},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2021-04-20T14:46:39.752Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {false},\n hidden = {false},\n citation_key = {Gliesch.EtAl/2020similarity},\n private_publication = {false},\n bibtype = {inproceedings},\n author = {Gliesch, A. and Ritt, M. and Cruz, A. H. S. and Moreira, M. C. O.},\n booktitle = {Annals of IEEE WORLD CONGRESS ON COMPUTATIONAL INTELLIGENCE (WCCI) 2020}\n}</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"pereira-alves-moreira-amultiperiodworkforceschedulingandroutingproblemwithdependenttasks-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.sciencedirect.com/science/article/abs/pii/S0305054820300472\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'pereira-alves-moreira-amultiperiodworkforceschedulingandroutingproblemwithdependenttasks-2020', 'https://www.sciencedirect.com/science/article/abs/pii/S0305054820300472', event);\">\n    A Multiperiod Workforce Scheduling and Routing Problem with Dependent Tasks.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Pereira,  D., L.; Alves,  J., C.;  and <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., O.</a>\n</span>\n\n  \n\n</span>\n\n  <i>Computers & Operations Research</i>, 118: 104930.  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.sciencedirect.com/science/article/abs/pii/S0305054820300472\"\n     onclick=\"log_download('pereira-alves-moreira-amultiperiodworkforceschedulingandroutingproblemwithdependenttasks-2020', 'https://www.sciencedirect.com/science/article/abs/pii/S0305054820300472', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"A Multiperiod Workforce Scheduling and Routing Problem with Dependent Tasks [link]\"\n       title=\"Website\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Website</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1016/j.cor.2020.104930\"\n     onclick=\"log_download('pereira-alves-moreira-amultiperiodworkforceschedulingandroutingproblemwithdependenttasks-2020', 'http://doi.org/10.1016/j.cor.2020.104930', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/pereira-alves-moreira-amultiperiodworkforceschedulingandroutingproblemwithdependenttasks-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('pereira-alves-moreira-amultiperiodworkforceschedulingandroutingproblemwithdependenttasks-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{\n title = {A Multiperiod Workforce Scheduling and Routing Problem with Dependent Tasks},\n type = {article},\n year = {2020},\n pages = {104930},\n volume = {118},\n websites = {https://www.sciencedirect.com/science/article/abs/pii/S0305054820300472},\n id = {761a0d15-69df-3ba8-9711-d7f34907247e},\n created = {2020-06-28T20:55:38.260Z},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2021-04-20T14:46:40.044Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {false},\n hidden = {false},\n citation_key = {Pereira.EtAl/2020},\n private_publication = {false},\n bibtype = {article},\n author = {Pereira, D. L. and Alves, J. C. and Moreira, M. C. O.},\n doi = {10.1016/j.cor.2020.104930},\n journal = {Computers &amp; Operations Research}\n}</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"iori-locatelli-moreira-silveira-reactivegraspbasedalgorithmforpalletbuildingproblemwithvisibilityandcontiguityconstraints-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://link.springer.com/chapter/10.1007/978-3-030-59747-4_42\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'iori-locatelli-moreira-silveira-reactivegraspbasedalgorithmforpalletbuildingproblemwithvisibilityandcontiguityconstraints-2020', 'https://link.springer.com/chapter/10.1007/978-3-030-59747-4_42', event);\">\n    Reactive GRASP-based Algorithm for Pallet Building Problem with Visibility and Contiguity Constraints.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Iori,  M.; Locatelli,  M.; <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., d., O.</a>;  and Silveira,  T.\n</span>\n\n  \n\n</span>\n\n  In <i>International Conference on Computational Logistics</i>, pages 651-665,  2020. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://link.springer.com/chapter/10.1007/978-3-030-59747-4_42\"\n     onclick=\"log_download('iori-locatelli-moreira-silveira-reactivegraspbasedalgorithmforpalletbuildingproblemwithvisibilityandcontiguityconstraints-2020', 'https://link.springer.com/chapter/10.1007/978-3-030-59747-4_42', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Reactive GRASP-based Algorithm for Pallet Building Problem with Visibility and Contiguity Constraints [link]\"\n       title=\"Website\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Website</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/iori-locatelli-moreira-silveira-reactivegraspbasedalgorithmforpalletbuildingproblemwithvisibilityandcontiguityconstraints-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('iori-locatelli-moreira-silveira-reactivegraspbasedalgorithmforpalletbuildingproblemwithvisibilityandcontiguityconstraints-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{\n title = {Reactive GRASP-based Algorithm for Pallet Building Problem with Visibility and Contiguity Constraints},\n type = {inproceedings},\n year = {2020},\n pages = {651-665},\n websites = {https://link.springer.com/chapter/10.1007/978-3-030-59747-4_42},\n city = {Enschede},\n id = {ed82774e-2f85-3223-a477-defc82d47231},\n created = {2021-04-20T14:37:35.268Z},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2021-04-20T14:37:35.268Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n citation_key = {Iori.EtAl/2020},\n private_publication = {false},\n bibtype = {inproceedings},\n author = {Iori, Manuel and Locatelli, Marco and Moreira, Mayron César de Oliveira and Silveira, Tiago},\n booktitle = {International Conference on Computational Logistics}\n}</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"ferreira-moreira-andretta-nestingproblemswithcontinuousrotationsasurvey-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://proceedings.science/sbpo-2020/papers/nesting-problems-with-continuous-rotations--a-survey\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'ferreira-moreira-andretta-nestingproblemswithcontinuousrotationsasurvey-2020', 'https://proceedings.science/sbpo-2020/papers/nesting-problems-with-continuous-rotations--a-survey', event);\">\n    Nesting problems with continuous rotations: a survey.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Ferreira,  A., S.; <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., O.</a>;  and Andretta,  M.\n</span>\n\n  \n\n</span>\n\n  In <i>LII Simpósio Brasileiro de Pesquisa Operacional</i>, pages 1-12,  2020. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://proceedings.science/sbpo-2020/papers/nesting-problems-with-continuous-rotations--a-survey\"\n     onclick=\"log_download('ferreira-moreira-andretta-nestingproblemswithcontinuousrotationsasurvey-2020', 'https://proceedings.science/sbpo-2020/papers/nesting-problems-with-continuous-rotations--a-survey', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Nesting problems with continuous rotations: a survey [link]\"\n       title=\"Website\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Website</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ferreira-moreira-andretta-nestingproblemswithcontinuousrotationsasurvey-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ferreira-moreira-andretta-nestingproblemswithcontinuousrotationsasurvey-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{\n title = {Nesting problems with continuous rotations: a survey},\n type = {inproceedings},\n year = {2020},\n pages = {1-12},\n websites = {https://proceedings.science/sbpo-2020/papers/nesting-problems-with-continuous-rotations--a-survey},\n city = {João Pessoa},\n id = {e8d7a7b4-e329-3236-9c9a-15873e4fc66b},\n created = {2021-04-20T14:37:35.300Z},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2021-04-20T14:37:35.300Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n citation_key = {Ferreira.EtAl/2020},\n private_publication = {false},\n bibtype = {inproceedings},\n author = {Ferreira, A. S. and Moreira, M. C. O. and Andretta, M.},\n booktitle = {LII Simpósio Brasileiro de Pesquisa Operacional}\n}</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2018\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2018')\"\n      onkeypress=\"toggleGroup('group_2018')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2018</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"gliesch-ritt-moreira-amultistartalternatingtabusearchforcommercialdistricting-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://link.springer.com/chapter/10.1007/978-3-319-77449-7_11\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'gliesch-ritt-moreira-amultistartalternatingtabusearchforcommercialdistricting-2018', 'https://link.springer.com/chapter/10.1007/978-3-319-77449-7_11', event);\">\n    A Multistart Alternating Tabu Search for Commercial Districting.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Gliesch,  A.; Ritt,  M.;  and <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., O.</a>\n</span>\n\n  \n\n</span>\n\n  In Liefooghe,  A.;  and López-Ibáñez,  M., editor(s), <i>Annals of Evolutionary Computation in Combinatorial Optimization</i>, pages 158-173,  2018. Springer Nature\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://link.springer.com/chapter/10.1007/978-3-319-77449-7_11\"\n     onclick=\"log_download('gliesch-ritt-moreira-amultistartalternatingtabusearchforcommercialdistricting-2018', 'https://link.springer.com/chapter/10.1007/978-3-319-77449-7_11', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"A Multistart Alternating Tabu Search for Commercial Districting [link]\"\n       title=\"Website\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Website</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gliesch-ritt-moreira-amultistartalternatingtabusearchforcommercialdistricting-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gliesch-ritt-moreira-amultistartalternatingtabusearchforcommercialdistricting-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{\n title = {A Multistart Alternating Tabu Search for Commercial Districting},\n type = {inproceedings},\n year = {2018},\n pages = {158-173},\n websites = {https://link.springer.com/chapter/10.1007/978-3-319-77449-7_11},\n publisher = {Springer Nature},\n city = {Parma},\n id = {b472e1b0-5fe9-3adc-8897-8adff73db82d},\n created = {2018-02-21T21:44:39.960Z},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2018-10-06T22:33:47.073Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n private_publication = {false},\n 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.},\n bibtype = {inproceedings},\n author = {Gliesch, A. and Ritt, M. and Moreira, M. C. O.},\n editor = {Liefooghe, A. and López-Ibáñez, M.},\n booktitle = {Annals of Evolutionary Computation in Combinatorial Optimization}\n}</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  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.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"campana-moreira-modelomatemticoeheursticasparaoproblemadebalanceamentodelinhasdeproduoedesignaohierrquicadetrabalhadores-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Modelo Matemático e Heurísticas para o Problema de Balanceamento de Linhas de Produção e Designação Hierárquica de Trabalhadores.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Campana,  N., P.;  and <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., O.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>Anais do 50 Simpósio Brasileiro de Pesquisa Operacional</i>, pages 1-8,  2018. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/campana-moreira-modelomatemticoeheursticasparaoproblemadebalanceamentodelinhasdeproduoedesignaohierrquicadetrabalhadores-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('campana-moreira-modelomatemticoeheursticasparaoproblemadebalanceamentodelinhasdeproduoedesignaohierrquicadetrabalhadores-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{\n title = {Modelo Matemático e Heurísticas para o Problema de Balanceamento de Linhas de Produção e Designação Hierárquica de Trabalhadores},\n type = {inproceedings},\n year = {2018},\n pages = {1-8},\n city = {Rio de Janeiro},\n id = {e0304709-0067-3282-83a5-15967c1b4c06},\n created = {2018-10-06T22:31:00.597Z},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2018-10-06T22:36:42.072Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {false},\n hidden = {false},\n private_publication = {false},\n 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.},\n bibtype = {inproceedings},\n author = {Campana, N. P. and Moreira, M. C. O.},\n booktitle = {Anais do 50 Simpósio Brasileiro de Pesquisa Operacional}\n}</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  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.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2017\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2017')\"\n      onkeypress=\"toggleGroup('group_2017')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2017</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"moreira-pastor-costa-miralles-themultiobjectiveassemblylineworkerintegrationandbalancingproblemoftype2-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.sciencedirect.com/science/article/pii/S0305054817300059\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'moreira-pastor-costa-miralles-themultiobjectiveassemblylineworkerintegrationandbalancingproblemoftype2-2017', 'http://www.sciencedirect.com/science/article/pii/S0305054817300059', event);\">\n    The multi-objective assembly line worker integration and balancing problem of type-2.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., O.</a>; Pastor,  R.; Costa,  A., M.;  and Miralles,  C.\n</span>\n\n  \n\n</span>\n\n  <i>Computers & Operations Research</i>, 82: 114-125.  2017.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.sciencedirect.com/science/article/pii/S0305054817300059\"\n     onclick=\"log_download('moreira-pastor-costa-miralles-themultiobjectiveassemblylineworkerintegrationandbalancingproblemoftype2-2017', 'http://www.sciencedirect.com/science/article/pii/S0305054817300059', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"The multi-objective assembly line worker integration and balancing problem of type-2 [link]\"\n       title=\"Website\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Website</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1016/j.cor.2017.01.003\"\n     onclick=\"log_download('moreira-pastor-costa-miralles-themultiobjectiveassemblylineworkerintegrationandbalancingproblemoftype2-2017', 'http://doi.org/10.1016/j.cor.2017.01.003', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/moreira-pastor-costa-miralles-themultiobjectiveassemblylineworkerintegrationandbalancingproblemoftype2-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('moreira-pastor-costa-miralles-themultiobjectiveassemblylineworkerintegrationandbalancingproblemoftype2-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{\n title = {The multi-objective assembly line worker integration and balancing problem of type-2},\n type = {article},\n year = {2017},\n pages = {114-125},\n volume = {82},\n websites = {http://www.sciencedirect.com/science/article/pii/S0305054817300059},\n id = {b9e74cf8-6361-3bf8-9f3e-6bb00ab977fb},\n created = {2017-02-07T15:33:25.000Z},\n accessed = {2017-02-07},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2017-03-15T01:49:32.045Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {false},\n hidden = {false},\n private_publication = {false},\n 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.},\n bibtype = {article},\n author = {Moreira, Mayron César O. and Pastor, Rafael and Costa, Alysson M. and Miralles, Cristóbal},\n doi = {10.1016/j.cor.2017.01.003},\n journal = {Computers &amp; Operations Research}\n}</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  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.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"gliesch-ritt-moreira-ageneticalgorithmforfairlandallocation-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8/file/298ddbe4-284c-294d-2046-ed84d0afe51a/Gliesch_etal_2017.pdf.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'gliesch-ritt-moreira-ageneticalgorithmforfairlandallocation-2017', 'https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8/file/298ddbe4-284c-294d-2046-ed84d0afe51a/Gliesch_etal_2017.pdf.pdf', event);\">\n    A genetic algorithm for fair land allocation.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Gliesch,  A.; Ritt,  M.;  and <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., O.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, pages 793-800,  2017. ACM\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8/file/298ddbe4-284c-294d-2046-ed84d0afe51a/Gliesch_etal_2017.pdf.pdf\"\n     onclick=\"log_download('gliesch-ritt-moreira-ageneticalgorithmforfairlandallocation-2017', 'https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8/file/298ddbe4-284c-294d-2046-ed84d0afe51a/Gliesch_etal_2017.pdf.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"A genetic algorithm for fair land allocation [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://dl.acm.org/citation.cfm?id=3071313\"\n     onclick=\"log_download('gliesch-ritt-moreira-ageneticalgorithmforfairlandallocation-2017', 'https://dl.acm.org/citation.cfm?id=3071313', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"A genetic algorithm for fair land allocation [link]\"\n       title=\"Website\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Website</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1145/3071178.3071313\"\n     onclick=\"log_download('gliesch-ritt-moreira-ageneticalgorithmforfairlandallocation-2017', 'http://doi.org/10.1145/3071178.3071313', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gliesch-ritt-moreira-ageneticalgorithmforfairlandallocation-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gliesch-ritt-moreira-ageneticalgorithmforfairlandallocation-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{\n title = {A genetic algorithm for fair land allocation},\n type = {inproceedings},\n year = {2017},\n keywords = {Gliesch_etal_2017},\n pages = {793-800},\n websites = {https://dl.acm.org/citation.cfm?id=3071313},\n publisher = {ACM},\n city = {Berlin},\n id = {6f3e81e6-984f-3007-b3dc-132703cad5b1},\n created = {2017-03-20T21:59:57.875Z},\n file_attached = {true},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2020-05-08T18:20:09.690Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n folder_uuids = {418968d6-a37c-409b-ad84-786ed498ab5f},\n private_publication = {false},\n 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.},\n bibtype = {inproceedings},\n author = {Gliesch, A. and Ritt, M. and Moreira, M. C. O.},\n doi = {10.1145/3071178.3071313},\n booktitle = {Proceedings of the Genetic and Evolutionary Computation Conference}\n}</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  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.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2015\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2015')\"\n      onkeypress=\"toggleGroup('group_2015')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2015</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"moreira-miralles-costa-modelandheuristicsfortheassemblylineworkerintegrationandbalancingproblem-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.sciencedirect.com/science/article/pii/S0305054814002317\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'moreira-miralles-costa-modelandheuristicsfortheassemblylineworkerintegrationandbalancingproblem-2015', 'http://www.sciencedirect.com/science/article/pii/S0305054814002317', event);\">\n    Model and heuristics for the Assembly Line Worker Integration and Balancing Problem.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., O.</a>; Miralles,  C.;  and Costa,  A., M.\n</span>\n\n  \n\n</span>\n\n  <i>Computers & Operations Research</i>, 54: 64-73.  2015.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.sciencedirect.com/science/article/pii/S0305054814002317\"\n     onclick=\"log_download('moreira-miralles-costa-modelandheuristicsfortheassemblylineworkerintegrationandbalancingproblem-2015', 'http://www.sciencedirect.com/science/article/pii/S0305054814002317', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Model and heuristics for the Assembly Line Worker Integration and Balancing Problem [link]\"\n       title=\"Website\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Website</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1016/j.cor.2014.08.021\"\n     onclick=\"log_download('moreira-miralles-costa-modelandheuristicsfortheassemblylineworkerintegrationandbalancingproblem-2015', 'http://doi.org/10.1016/j.cor.2014.08.021', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/moreira-miralles-costa-modelandheuristicsfortheassemblylineworkerintegrationandbalancingproblem-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('moreira-miralles-costa-modelandheuristicsfortheassemblylineworkerintegrationandbalancingproblem-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{\n title = {Model and heuristics for the Assembly Line Worker Integration and Balancing Problem},\n type = {article},\n year = {2015},\n pages = {64-73},\n volume = {54},\n websites = {http://www.sciencedirect.com/science/article/pii/S0305054814002317},\n id = {a6959e78-1bf6-3ff6-bc82-37310e62139e},\n created = {2016-11-23T13:37:25.000Z},\n accessed = {2016-11-23},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2017-03-15T01:49:32.045Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n citation_key = {MoreiraEtAL_2015_cor},\n private_publication = {false},\n 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.},\n bibtype = {article},\n author = {Moreira, Mayron César O. and Miralles, Cristóbal and Costa, Alysson M.},\n doi = {10.1016/j.cor.2014.08.021},\n journal = {Computers &amp; Operations Research}\n}</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  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.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"moreira-cordeau-costa-laporte-robustassemblylinebalancingwithheterogeneousworkers-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.sciencedirect.com/science/article/pii/S0360835215003058\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'moreira-cordeau-costa-laporte-robustassemblylinebalancingwithheterogeneousworkers-2015', 'http://www.sciencedirect.com/science/article/pii/S0360835215003058', event);\">\n    Robust assembly line balancing with heterogeneous workers.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., O.</a>; Cordeau,  J.; Costa,  A., M.;  and Laporte,  G.\n</span>\n\n  \n\n</span>\n\n  <i>Computers & Industrial Engineering</i>, 88: 254-263.  2015.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.sciencedirect.com/science/article/pii/S0360835215003058\"\n     onclick=\"log_download('moreira-cordeau-costa-laporte-robustassemblylinebalancingwithheterogeneousworkers-2015', 'http://www.sciencedirect.com/science/article/pii/S0360835215003058', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Robust assembly line balancing with heterogeneous workers [link]\"\n       title=\"Website\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Website</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1016/j.cie.2015.07.004\"\n     onclick=\"log_download('moreira-cordeau-costa-laporte-robustassemblylinebalancingwithheterogeneousworkers-2015', 'http://doi.org/10.1016/j.cie.2015.07.004', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/moreira-cordeau-costa-laporte-robustassemblylinebalancingwithheterogeneousworkers-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('moreira-cordeau-costa-laporte-robustassemblylinebalancingwithheterogeneousworkers-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{\n title = {Robust assembly line balancing with heterogeneous workers},\n type = {article},\n year = {2015},\n pages = {254-263},\n volume = {88},\n websites = {http://www.sciencedirect.com/science/article/pii/S0360835215003058},\n id = {39ee30c9-864f-3359-a4d7-e28e77b88de7},\n created = {2016-11-23T13:41:05.000Z},\n accessed = {2016-11-23},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2017-03-15T01:49:32.045Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n citation_key = {MoreiraEtAl_2015_caie},\n private_publication = {false},\n 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.},\n bibtype = {article},\n author = {Moreira, Mayron César O. and Cordeau, Jean-François and Costa, Alysson M. and Laporte, Gilbert},\n doi = {10.1016/j.cie.2015.07.004},\n journal = {Computers &amp; Industrial Engineering}\n}</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  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.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2013\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2013')\"\n      onkeypress=\"toggleGroup('group_2013')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2013</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"moreira-costa-hybridheuristicsforplanningjobrotationschedulesinassemblylineswithheterogeneousworkers-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.sciencedirect.com/science/article/pii/S0925527312004070\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'moreira-costa-hybridheuristicsforplanningjobrotationschedulesinassemblylineswithheterogeneousworkers-2013', 'http://www.sciencedirect.com/science/article/pii/S0925527312004070', event);\">\n    Hybrid heuristics for planning job rotation schedules in assembly lines with heterogeneous workers.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., O.</a>;  and Costa,  A., M.\n</span>\n\n  \n\n</span>\n\n  <i>International Journal of Production Economics</i>, 141: 552-560.  2013.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.sciencedirect.com/science/article/pii/S0925527312004070\"\n     onclick=\"log_download('moreira-costa-hybridheuristicsforplanningjobrotationschedulesinassemblylineswithheterogeneousworkers-2013', 'http://www.sciencedirect.com/science/article/pii/S0925527312004070', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Hybrid heuristics for planning job rotation schedules in assembly lines with heterogeneous workers [link]\"\n       title=\"Website\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Website</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1016/j.ijpe.2012.09.011\"\n     onclick=\"log_download('moreira-costa-hybridheuristicsforplanningjobrotationschedulesinassemblylineswithheterogeneousworkers-2013', 'http://doi.org/10.1016/j.ijpe.2012.09.011', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/moreira-costa-hybridheuristicsforplanningjobrotationschedulesinassemblylineswithheterogeneousworkers-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('moreira-costa-hybridheuristicsforplanningjobrotationschedulesinassemblylineswithheterogeneousworkers-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{\n title = {Hybrid heuristics for planning job rotation schedules in assembly lines with heterogeneous workers},\n type = {article},\n year = {2013},\n pages = {552-560},\n volume = {141},\n websites = {http://www.sciencedirect.com/science/article/pii/S0925527312004070},\n id = {7600ed06-ff26-36be-bae9-816f534c81f7},\n created = {2016-11-23T13:43:35.000Z},\n accessed = {2016-11-23},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2017-03-15T01:49:32.045Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n citation_key = {MoreiraCosta_2013_ijpe},\n private_publication = {false},\n 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.},\n bibtype = {article},\n author = {Moreira, Mayron César O. and Costa, Alysson M.},\n doi = {10.1016/j.ijpe.2012.09.011},\n journal = {International Journal of Production Economics}\n}</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  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.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2012\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2012')\"\n      onkeypress=\"toggleGroup('group_2012')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2012</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"moreira-miralles-costa-assemblylineworkerintegrationandbalancingproblem-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Assembly line worker integration and balancing problem.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., O.</a>; Miralles,  C.;  and Costa,  A., M.\n</span>\n\n  \n\n</span>\n\n  In <i>Anais do XVI Congreso Latinoamericano de Investigación Operativa / XLIV Simpósio Brasileiro de Pesquisa Operacional</i>, pages 54-65,  2012. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/moreira-miralles-costa-assemblylineworkerintegrationandbalancingproblem-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('moreira-miralles-costa-assemblylineworkerintegrationandbalancingproblem-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{\n title = {Assembly line worker integration and balancing problem},\n type = {inproceedings},\n year = {2012},\n pages = {54-65},\n city = {Rio de Janeiro, Brasil},\n id = {e74d5c12-49f4-3ce1-b28b-1b8492697ba1},\n created = {2013-02-14T21:48:22.000Z},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2017-03-15T01:49:32.045Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n citation_key = {MoreiraEtAl_2012_sbpo},\n folder_uuids = {fa9d7e32-9b97-4fe2-9e9c-62c40efc637d},\n private_publication = {false},\n 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.},\n bibtype = {inproceedings},\n author = {Moreira, M. C. O. and Miralles, C. and Costa, A. M.},\n booktitle = {Anais do XVI Congreso Latinoamericano de Investigación Operativa / XLIV Simpósio Brasileiro de Pesquisa Operacional}\n}</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  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.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"moreira-ritt-costa-chaves-simpleheuristicsfortheassemblylineworkerassignmentandbalancingproblem-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://dx.doi.org/10.1007/s10732-012-9195-5\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'moreira-ritt-costa-chaves-simpleheuristicsfortheassemblylineworkerassignmentandbalancingproblem-2012', 'http://dx.doi.org/10.1007/s10732-012-9195-5', event);\">\n    Simple heuristics for the assembly line worker assignment and balancing problem.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., O.</a>; Ritt,  M.; Costa,  A., M.;  and Chaves,  A., A.\n</span>\n\n  \n\n</span>\n\n  <i>Journal of Heuristics</i>, 18(3): 505-524.  2012.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://dx.doi.org/10.1007/s10732-012-9195-5\"\n     onclick=\"log_download('moreira-ritt-costa-chaves-simpleheuristicsfortheassemblylineworkerassignmentandbalancingproblem-2012', 'http://dx.doi.org/10.1007/s10732-012-9195-5', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Simple heuristics for the assembly line worker assignment and balancing problem [link]\"\n       title=\"Website\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Website</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/s10732-012-9195-5\"\n     onclick=\"log_download('moreira-ritt-costa-chaves-simpleheuristicsfortheassemblylineworkerassignmentandbalancingproblem-2012', 'http://doi.org/10.1007/s10732-012-9195-5', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/moreira-ritt-costa-chaves-simpleheuristicsfortheassemblylineworkerassignmentandbalancingproblem-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('moreira-ritt-costa-chaves-simpleheuristicsfortheassemblylineworkerassignmentandbalancingproblem-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{\n title = {Simple heuristics for the assembly line worker assignment and balancing problem},\n type = {article},\n year = {2012},\n pages = {505-524},\n volume = {18},\n websites = {http://dx.doi.org/10.1007/s10732-012-9195-5},\n id = {d42533dd-957a-3b71-8430-9e436fe5c138},\n created = {2016-11-23T13:43:51.000Z},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2017-03-15T01:49:32.045Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n citation_key = {MoreiraEtAl_2012_jh},\n source_type = {article},\n private_publication = {false},\n 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.},\n bibtype = {article},\n author = {Moreira, Mayron César O and Ritt, Marcus and Costa, Alysson M and Chaves, Antonio A},\n doi = {10.1007/s10732-012-9195-5},\n journal = {Journal of Heuristics},\n number = {3}\n}</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  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.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2011\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2011')\"\n      onkeypress=\"toggleGroup('group_2011')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2011</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"ferreiraneto-moreira-santosjunior-paleo-lani-aptidoagrcolaealgoritmosgenticosnaorganizaoespacialemprojetosdereformaagrria-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.scielo.br/scielo.php?script=sci_arttext&amp;pid=S0100-06832011000100024&amp;lng=pt&amp;nrm=iso&amp;tlng=pt\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'ferreiraneto-moreira-santosjunior-paleo-lani-aptidoagrcolaealgoritmosgenticosnaorganizaoespacialemprojetosdereformaagrria-2011', 'http://www.scielo.br/scielo.php?script=sci_arttext&amp;pid=S0100-06832011000100024&amp;lng=pt&amp;nrm=iso&amp;tlng=pt', event);\">\n    Aptidão agrícola e algoritmos genéticos na organização espacial em projetos de reforma agrária.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Ferreira Neto,  J., A.; <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., d., O.</a>; Santos Junior,  E., C., d.; Paleo,  U., F.;  and Lani,  J., L.\n</span>\n\n  \n\n</span>\n\n  <i>Revista Brasileira de Ciência do Solo</i>, 35: 255-261. 2 2011.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.scielo.br/scielo.php?script=sci_arttext&amp;pid=S0100-06832011000100024&amp;lng=pt&amp;nrm=iso&amp;tlng=pt\"\n     onclick=\"log_download('ferreiraneto-moreira-santosjunior-paleo-lani-aptidoagrcolaealgoritmosgenticosnaorganizaoespacialemprojetosdereformaagrria-2011', 'http://www.scielo.br/scielo.php?script=sci_arttext&amp;pid=S0100-06832011000100024&amp;lng=pt&amp;nrm=iso&amp;tlng=pt', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Aptidão agrícola e algoritmos genéticos na organização espacial em projetos de reforma agrária [link]\"\n       title=\"Website\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Website</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1590/S0100-06832011000100024\"\n     onclick=\"log_download('ferreiraneto-moreira-santosjunior-paleo-lani-aptidoagrcolaealgoritmosgenticosnaorganizaoespacialemprojetosdereformaagrria-2011', 'http://doi.org/10.1590/S0100-06832011000100024', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ferreiraneto-moreira-santosjunior-paleo-lani-aptidoagrcolaealgoritmosgenticosnaorganizaoespacialemprojetosdereformaagrria-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ferreiraneto-moreira-santosjunior-paleo-lani-aptidoagrcolaealgoritmosgenticosnaorganizaoespacialemprojetosdereformaagrria-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{\n title = {Aptidão agrícola e algoritmos genéticos na organização espacial em projetos de reforma agrária},\n type = {article},\n year = {2011},\n pages = {255-261},\n volume = {35},\n websites = {http://www.scielo.br/scielo.php?script=sci_arttext&amp;pid=S0100-06832011000100024&amp;lng=pt&amp;nrm=iso&amp;tlng=pt},\n month = {2},\n publisher = {Sociedade Brasileira de Ciência do Solo},\n id = {cbec8164-444e-317e-aa1b-ab5d2f050ed3},\n created = {2016-11-23T14:01:18.000Z},\n accessed = {2016-11-23},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2017-03-15T01:49:32.045Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n citation_key = {FerreiraNetoEtAl_2011_rbcs},\n private_publication = {false},\n 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. },\n bibtype = {article},\n 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},\n doi = {10.1590/S0100-06832011000100024},\n journal = {Revista Brasileira de Ciência do Solo}\n}</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  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. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"ferreiraneto-dossantosjunior-paleo-moreira-optimalsubdivisionoflandinagrarianreformprojectsananalysisusinggeneticalgorithms-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://rcia.uc.cl/index.php/rcia/article/view/111\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'ferreiraneto-dossantosjunior-paleo-moreira-optimalsubdivisionoflandinagrarianreformprojectsananalysisusinggeneticalgorithms-2011', 'http://rcia.uc.cl/index.php/rcia/article/view/111', event);\">\n    Optimal subdivision of land in agrarian reform projects: an analysis using genetic algorithms.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Ferreira Neto,  J., A.; dos Santos Junior,  E., C.; Paleo,  U., F.;  and <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., d., O.</a>\n</span>\n\n  \n\n</span>\n\n  <i>Ciencia e Investigación Agraria</i>, 38: 169-178.  2011.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://rcia.uc.cl/index.php/rcia/article/view/111\"\n     onclick=\"log_download('ferreiraneto-dossantosjunior-paleo-moreira-optimalsubdivisionoflandinagrarianreformprojectsananalysisusinggeneticalgorithms-2011', 'http://rcia.uc.cl/index.php/rcia/article/view/111', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Optimal subdivision of land in agrarian reform projects: an analysis using genetic algorithms [link]\"\n       title=\"Website\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Website</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/http://dx.doi.org/10.4067/rcia.v38i2.111\"\n     onclick=\"log_download('ferreiraneto-dossantosjunior-paleo-moreira-optimalsubdivisionoflandinagrarianreformprojectsananalysisusinggeneticalgorithms-2011', 'http://doi.org/http://dx.doi.org/10.4067/rcia.v38i2.111', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ferreiraneto-dossantosjunior-paleo-moreira-optimalsubdivisionoflandinagrarianreformprojectsananalysisusinggeneticalgorithms-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ferreiraneto-dossantosjunior-paleo-moreira-optimalsubdivisionoflandinagrarianreformprojectsananalysisusinggeneticalgorithms-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{\n title = {Optimal subdivision of land in agrarian reform projects: an analysis using genetic algorithms},\n type = {article},\n year = {2011},\n keywords = {Agrarian reform,genetic algorithm,rural settlement,spatial planning},\n pages = {169-178},\n volume = {38},\n websites = {http://rcia.uc.cl/index.php/rcia/article/view/111},\n id = {db390d9c-c661-3183-9e49-e9eed1b712b5},\n created = {2016-11-23T16:10:39.000Z},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2017-03-15T01:49:32.045Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n citation_key = {FerreiraNetoEtAl_2011_cia},\n source_type = {article},\n private_publication = {false},\n 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.},\n bibtype = {article},\n author = {Ferreira Neto, José Ambrósio and dos Santos Junior, Edgard Carneiro and Paleo, Urbano Fra and Moreira, Mayron César de Oliveira},\n doi = {http://dx.doi.org/10.4067/rcia.v38i2.111},\n journal = {Ciencia e Investigación Agraria}\n}</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  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.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"moreira-ferreiraneto-einloft-silva-desenvolvimentoruralsustentabilidadeeordenamentoterritorial-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  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).\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., O.</a>; Ferreira Neto,  J., A.; Einloft,  C., J.;  and Silva,  N., T., C.\n</span>\n\n  \n\n</span>\n\n  Desenvolvimento Rural, sustentabilidade e ordenamento territorial, pages 265-272. José Ambrósio Ferreira Neto Carlos Joaquim Einloft;  and Renato Luiz Gonçalves, editor(s). Suprema, 1 edition,  2011.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/moreira-ferreiraneto-einloft-silva-desenvolvimentoruralsustentabilidadeeordenamentoterritorial-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('moreira-ferreiraneto-einloft-silva-desenvolvimentoruralsustentabilidadeeordenamentoterritorial-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inbook{\n type = {inbook},\n year = {2011},\n pages = {265-272},\n publisher = {Suprema},\n city = {Visconde do rio Branco},\n edition = {1},\n id = {f4717537-8269-36fc-a9de-e338cf512860},\n created = {2017-01-03T19:05:58.000Z},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2017-03-15T01:49:32.045Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {false},\n hidden = {false},\n citation_key = {Moreira2011},\n private_publication = {false},\n bibtype = {inbook},\n author = {Moreira, M. C. O. and Ferreira Neto, J. A. and Einloft, C. J. and Silva, N. T. C.},\n editor = {José Ambrósio Ferreira Neto Carlos Joaquim Einloft, undefined and Renato Luiz Gonçalves, undefined},\n 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)},\n title = {Desenvolvimento Rural, sustentabilidade e ordenamento territorial}\n}</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2010\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2010')\"\n      onkeypress=\"toggleGroup('group_2010')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2010</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"milagres-ferreiraneto-moura-moreira-princpiosdecartografiasocialemdiagnsticosparticipativosemprojetosdereformaagrria-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Princípios de Cartografia Social em Diagnósticos Participativos em Projetos de Reforma Agrária.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Milagres,  C., S., F.; Ferreira Neto,  J., A.; Moura,  R., A.;  and <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., O.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>Anais do IV Congresso de Estudos Rurais</i>, pages 993-1002,  2010. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/milagres-ferreiraneto-moura-moreira-princpiosdecartografiasocialemdiagnsticosparticipativosemprojetosdereformaagrria-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('milagres-ferreiraneto-moura-moreira-princpiosdecartografiasocialemdiagnsticosparticipativosemprojetosdereformaagrria-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{\n title = {Princípios de Cartografia Social em Diagnósticos Participativos em Projetos de Reforma Agrária},\n type = {inproceedings},\n year = {2010},\n pages = {993-1002},\n city = {Aveiro},\n id = {c7aa00f3-441d-3347-bbe0-5d1bac6ef53d},\n created = {2016-11-23T16:10:39.000Z},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2017-03-15T01:49:32.045Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n private_publication = {false},\n bibtype = {inproceedings},\n author = {Milagres, C. S. F. and Ferreira Neto, J. A. and Moura, R. A. and Moreira, M. C. O.},\n booktitle = {Anais do IV Congresso de Estudos Rurais}\n}</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"ferreiraneto-milagres-sousa-moreira-recursosnaturaissistemasdeinformaogeogrficaeprocessossociais-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  O uso do aplicativo SOTER e da cartografia social na organização territorial em projetos de reforma agrária.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Ferreira Neto,  J., A.; Milagres,  C., S., F.; Sousa,  D., N.;  and <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., O.</a>\n</span>\n\n  \n\n</span>\n\n  Recursos Naturais, Sistemas de Informação Geográfica e Processos Sociais, pages 238-248. José Ambrósio Ferreira Neto Diego Neves de Souza;  and Cleiton Silva Ferreira Milagres, editor(s). Suprema, 1 edition,  2010.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ferreiraneto-milagres-sousa-moreira-recursosnaturaissistemasdeinformaogeogrficaeprocessossociais-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ferreiraneto-milagres-sousa-moreira-recursosnaturaissistemasdeinformaogeogrficaeprocessossociais-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inbook{\n type = {inbook},\n year = {2010},\n pages = {238-248},\n publisher = {Suprema},\n city = {Visconde do Rio Branco},\n edition = {1},\n id = {2535afb7-7b87-3131-a79e-f5f39e95a630},\n created = {2017-01-03T19:08:10.000Z},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2017-03-15T01:49:32.045Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {false},\n hidden = {false},\n citation_key = {FerreiraNeto2010},\n private_publication = {false},\n bibtype = {inbook},\n author = {Ferreira Neto, J. A. and Milagres, C. S. F. and Sousa, D. N. and Moreira, M. C. O.},\n editor = {José Ambrósio Ferreira Neto Diego Neves de Souza, undefined and Cleiton Silva Ferreira Milagres, undefined},\n chapter = {O uso do aplicativo SOTER e da cartografia social na organização territorial em projetos de reforma agrária},\n title = {Recursos Naturais, Sistemas de Informação Geográfica e Processos Sociais}\n}</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2009\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2009')\"\n      onkeypress=\"toggleGroup('group_2009')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2009</span>\n      <span class=\"bibbase_group_count\">\n        \n        (5)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"moreira-costa-aminimalistyetefficienttabusearchalgorithmforbalancingassemblylineswithdisabledworkers-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A minimalist yet efficient tabu search algorithm for balancing assembly lines with disabled workers.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., O.</a>;  and Costa,  A., M.\n</span>\n\n  \n\n</span>\n\n  In <i>Anais do XLI Simpósio Brasileiro de Pesquisa Operacional</i>, pages 660-671,  2009. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/moreira-costa-aminimalistyetefficienttabusearchalgorithmforbalancingassemblylineswithdisabledworkers-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('moreira-costa-aminimalistyetefficienttabusearchalgorithmforbalancingassemblylineswithdisabledworkers-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{\n title = {A minimalist yet efficient tabu search algorithm for balancing assembly lines with disabled workers},\n type = {inproceedings},\n year = {2009},\n pages = {660-671},\n city = {Porto Seguro, Brasil},\n id = {788d88b7-5dea-3433-b0c4-9fa163894dbb},\n created = {2012-02-06T13:50:46.000Z},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2017-03-15T01:49:32.045Z},\n read = {true},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n citation_key = {moreira2009minimalist},\n folder_uuids = {fa9d7e32-9b97-4fe2-9e9c-62c40efc637d,1a1db06d-3666-4c6d-b24d-c64de105eaa8},\n private_publication = {false},\n abstract = {We face the problem of programming assembly lines when each task has a different completion time\r\ndepending on the worker assigned to its execution.  This problem appears in the context of sheltered\r\nwork centers for the disabled,  where the workers have disabilities that might impede or difficult the\r\ncarrying  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.},\n bibtype = {inproceedings},\n author = {Moreira, M. C. O. and Costa, A. M.},\n booktitle = {Anais do XLI Simpósio Brasileiro de Pesquisa Operacional}\n}</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We face the problem of programming assembly lines when each task has a different completion time\r\ndepending on the worker assigned to its execution.  This problem appears in the context of sheltered\r\nwork centers for the disabled,  where the workers have disabilities that might impede or difficult the\r\ncarrying  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.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"januario-moreira-arroyo-santos-umalgoritmogenticohbridoparaoproblemanowaitflowshopcommakespaneatrasomximo-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Um algoritmo genético híbrido para o problema no-wait flowshop com makespan e atraso máximo.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Januario,  T., d., O.; <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., d., O.</a>; Arroyo,  J., E., C.;  and Santos,  A., G., d.\n</span>\n\n  \n\n</span>\n\n  In <i>Anais do XLI Simpósio Brasileiro de Pesquisa Operacional</i>, pages 2109-2120,  2009. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/januario-moreira-arroyo-santos-umalgoritmogenticohbridoparaoproblemanowaitflowshopcommakespaneatrasomximo-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('januario-moreira-arroyo-santos-umalgoritmogenticohbridoparaoproblemanowaitflowshopcommakespaneatrasomximo-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{\n title = {Um algoritmo genético híbrido para o problema no-wait flowshop com makespan e atraso máximo},\n type = {inproceedings},\n year = {2009},\n pages = {2109-2120},\n city = {Porto Seguro},\n id = {66457900-76bf-3c17-a52d-9fc52181c674},\n created = {2016-11-23T14:01:34.000Z},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2017-03-15T01:49:32.045Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n citation_key = {JanuarioEtAl_2009},\n source_type = {article},\n private_publication = {false},\n abstract = {This paper considers the \r\nm-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. },\n bibtype = {inproceedings},\n author = {Januario, Tiago de Oliveira and Moreira, Mayron César de Oliveira and Arroyo, José Elias Claudio and Santos, André Gustavo dos},\n booktitle = {Anais do XLI Simpósio Brasileiro de Pesquisa Operacional}\n}</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper considers the \r\nm-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. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"januario-arroyo-moreira-natureinspiredcooperativestrategiesforoptimizationnicso2008-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://link.springer.com/chapter/10.1007%2F978-3-642-03211-0_13\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'januario-arroyo-moreira-natureinspiredcooperativestrategiesforoptimizationnicso2008-2009', 'http://link.springer.com/chapter/10.1007%2F978-3-642-03211-0_13', event);\">\n    Genetic Algorithm for Tardiness Minimization in Flowshop with Blocking.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Januario,  T., d., O.; Arroyo,  J., E., C.;  and <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., O.</a>\n</span>\n\n  \n\n</span>\n\n  Nature Inspired Cooperative Strategies for Optimization (NICSO 2008), pages 153-164. Springer Heidelberg,  2009.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://link.springer.com/chapter/10.1007%2F978-3-642-03211-0_13\"\n     onclick=\"log_download('januario-arroyo-moreira-natureinspiredcooperativestrategiesforoptimizationnicso2008-2009', 'http://link.springer.com/chapter/10.1007%2F978-3-642-03211-0_13', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Nature Inspired Cooperative Strategies for Optimization (NICSO 2008) [link]\"\n       title=\"Website\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Website</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-642-03211-0_13\"\n     onclick=\"log_download('januario-arroyo-moreira-natureinspiredcooperativestrategiesforoptimizationnicso2008-2009', 'http://doi.org/10.1007/978-3-642-03211-0_13', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/januario-arroyo-moreira-natureinspiredcooperativestrategiesforoptimizationnicso2008-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('januario-arroyo-moreira-natureinspiredcooperativestrategiesforoptimizationnicso2008-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inbook{\n type = {inbook},\n year = {2009},\n pages = {153-164},\n websites = {http://link.springer.com/chapter/10.1007%2F978-3-642-03211-0_13},\n publisher = {Springer Heidelberg},\n city = {Berlin},\n id = {889e2d67-3e70-3106-904e-bfbff847ae96},\n created = {2016-11-23T14:01:34.000Z},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2017-03-15T01:49:32.045Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n citation_key = {januario2009genetic},\n source_type = {incollection},\n private_publication = {false},\n 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.},\n bibtype = {inbook},\n author = {Januario, Tiago de O and Arroyo, José Elias C and Moreira, Mayron César O},\n doi = {10.1007/978-3-642-03211-0_13},\n chapter = {Genetic Algorithm for Tardiness Minimization in Flowshop with Blocking},\n title = {Nature Inspired Cooperative Strategies for Optimization (NICSO 2008)}\n}</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  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.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"costa-santos-moreira-anlisedaeficinciadelinhasdeproduocomtrabalhadoresdeficientes-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Análise da eficiência de linhas de produção com trabalhadores deficientes.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Costa,  A., M.; Santos,  L., M., R.;  and <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., O.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>Anais do XLI Simpósio Brasileiro de Pesquisa Operacional</i>, pages 698-709,  2009. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/costa-santos-moreira-anlisedaeficinciadelinhasdeproduocomtrabalhadoresdeficientes-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('costa-santos-moreira-anlisedaeficinciadelinhasdeproduocomtrabalhadoresdeficientes-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{\n title = {Análise da eficiência de linhas de produção com trabalhadores deficientes},\n type = {inproceedings},\n year = {2009},\n pages = {698-709},\n city = {Porto Seguro},\n id = {fd3528e9-1c12-33ae-9338-97069d80298f},\n created = {2016-11-23T16:10:39.000Z},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2017-03-15T01:49:32.045Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n private_publication = {false},\n abstract = {People with disabilities are usually excluded from the work market. Although the reasons for this fact\r\nare 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.},\n bibtype = {inproceedings},\n author = {Costa, A. M. and Santos, L. M. R. and Moreira, M. C. O.},\n booktitle = {Anais do XLI Simpósio Brasileiro de Pesquisa Operacional}\n}</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  People with disabilities are usually excluded from the work market. Although the reasons for this fact\r\nare 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.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"pruski-moreira-silva-oliveira-moreira-griebeler-andrade-teixeira-terrao41prticasmecnicasparaaconservaodesoloeguaemreasagrcolas-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Terraço 4.1 - Práticas mecânicas para a conservação de solo e água em áreas agrícolas.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Pruski,  F., P.; Moreira,  G., T., G.; Silva,  J., M., A.; Oliveira,  C., P., F.; <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., O.</a>; Griebeler,  N., P.; Andrade,  M., V., A.;  and Teixeira,  A., F.\n</span>\n\n  \n\n</span>\n\n  AEAGRI, 1 edition,  2009.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/pruski-moreira-silva-oliveira-moreira-griebeler-andrade-teixeira-terrao41prticasmecnicasparaaconservaodesoloeguaemreasagrcolas-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('pruski-moreira-silva-oliveira-moreira-griebeler-andrade-teixeira-terrao41prticasmecnicasparaaconservaodesoloeguaemreasagrcolas-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@book{\n title = {Terraço 4.1 - Práticas mecânicas para a conservação de solo e água em áreas agrícolas},\n type = {book},\n year = {2009},\n pages = {88},\n publisher = {AEAGRI},\n city = {Viçosa},\n edition = {1},\n id = {0d912076-0e08-3a8a-8957-f520a52a8c49},\n created = {2017-01-03T19:02:15.000Z},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2017-03-15T01:49:32.045Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {false},\n hidden = {false},\n private_publication = {false},\n bibtype = {book},\n 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.}\n}</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2008\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2008')\"\n      onkeypress=\"toggleGroup('group_2008')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2008</span>\n      <span class=\"bibbase_group_count\">\n        \n        (5)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"januario-arroyo-moreira-algoritmogenticocombuscalocalparaaminimizaodoatrasototaldastarefasnoproblemadeprogramaoflowshoppermutacional-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Algoritmo Genético com Busca Local Para a Minimização do Atraso Total das Tarefas no Problema de Programação Flowshop Permutacional.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Januario,  T., d., O.; Arroyo,  J., E., C.;  and <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., d., O.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>Proccedings of XVII Congresso Brasileiro de Automática</i>, pages 1-12,  2008. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/januario-arroyo-moreira-algoritmogenticocombuscalocalparaaminimizaodoatrasototaldastarefasnoproblemadeprogramaoflowshoppermutacional-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('januario-arroyo-moreira-algoritmogenticocombuscalocalparaaminimizaodoatrasototaldastarefasnoproblemadeprogramaoflowshoppermutacional-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{\n title = {Algoritmo Genético com Busca Local Para a Minimização do Atraso Total das Tarefas no Problema de Programação Flowshop Permutacional},\n type = {inproceedings},\n year = {2008},\n pages = {1-12},\n id = {442f6750-4432-3f50-bd7c-469ece59d084},\n created = {2016-11-23T14:01:34.000Z},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2017-03-15T01:49:32.045Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n citation_key = {Januario_EtAl_2008_cba},\n source_type = {article},\n private_publication = {false},\n bibtype = {inproceedings},\n author = {Januario, Tiago de Oliveira and Arroyo, José Elias Claudio and Moreira, Mayron César de Oliveira},\n booktitle = {Proccedings of XVII Congresso Brasileiro de Automática}\n}</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"moreira-arroyo-janurio-oliveirajnior-umalgoritmoevolutivoparaoproblemadejobshopschedulingbiobjetivo-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Um algoritmo evolutivo para o problema de Job Shop Scheduling bi-objetivo.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., d., O.</a>; Arroyo,  J., E., C.; Januário,  T., d., O.;  and Oliveira Júnior,  P., L.\n</span>\n\n  \n\n</span>\n\n  In <i>Anais do XL Simpósio Brasileiro de Pesquisa Operacional</i>, pages 1-12,  2008. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/moreira-arroyo-janurio-oliveirajnior-umalgoritmoevolutivoparaoproblemadejobshopschedulingbiobjetivo-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('moreira-arroyo-janurio-oliveirajnior-umalgoritmoevolutivoparaoproblemadejobshopschedulingbiobjetivo-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{\n title = {Um algoritmo evolutivo para o problema de Job Shop Scheduling bi-objetivo},\n type = {inproceedings},\n year = {2008},\n pages = {1-12},\n city = {Joao Pessoa},\n id = {6d4f7188-b264-35f2-ba99-fa74056b8518},\n created = {2016-11-23T14:01:34.000Z},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2017-03-15T01:49:32.045Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n citation_key = {MoreiraEtAl_2008_sbpo},\n source_type = {article},\n private_publication = {false},\n abstract = {This  article  considers  the  Job  Shop  Sche\r\nduling  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. },\n bibtype = {inproceedings},\n 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},\n booktitle = {Anais do XL Simpósio Brasileiro de Pesquisa Operacional}\n}</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This  article  considers  the  Job  Shop  Sche\r\nduling  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. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"moreira-arroyo-januario-oliveira-geneticalgorithmsforbiobjectivejobshopschedulingproblem-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://ieeexplore.ieee.org/document/4626716/?reload=true\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'moreira-arroyo-januario-oliveira-geneticalgorithmsforbiobjectivejobshopschedulingproblem-2008', 'http://ieeexplore.ieee.org/document/4626716/?reload=true', event);\">\n    Genetic Algorithms for Bi-Objective Job Shop Scheduling Problem.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., O.</a>; Arroyo,  J., E., C.; Januario,  T., O.;  and Oliveira,  P., L.\n</span>\n\n  \n\n</span>\n\n  In <i>Proccedings of 8th International Conference on Hibrid Intelligent Systems</i>, pages 720-725,  2008. IEEE\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://ieeexplore.ieee.org/document/4626716/?reload=true\"\n     onclick=\"log_download('moreira-arroyo-januario-oliveira-geneticalgorithmsforbiobjectivejobshopschedulingproblem-2008', 'http://ieeexplore.ieee.org/document/4626716/?reload=true', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Genetic Algorithms for Bi-Objective Job Shop Scheduling Problem [link]\"\n       title=\"Website\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Website</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/HIS.2008.43\"\n     onclick=\"log_download('moreira-arroyo-januario-oliveira-geneticalgorithmsforbiobjectivejobshopschedulingproblem-2008', 'http://doi.org/10.1109/HIS.2008.43', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/moreira-arroyo-januario-oliveira-geneticalgorithmsforbiobjectivejobshopschedulingproblem-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('moreira-arroyo-januario-oliveira-geneticalgorithmsforbiobjectivejobshopschedulingproblem-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{\n title = {Genetic Algorithms for Bi-Objective Job Shop Scheduling Problem},\n type = {inproceedings},\n year = {2008},\n pages = {720-725},\n websites = {http://ieeexplore.ieee.org/document/4626716/?reload=true},\n publisher = {IEEE},\n city = {Barcelona},\n id = {b97b56e7-bc43-3ccb-bc93-1cfbfcb15692},\n created = {2016-11-23T14:01:34.000Z},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2017-03-15T01:49:32.045Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n citation_key = {MoreiraEtAl_2008_his},\n source_type = {article},\n private_publication = {false},\n 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.},\n bibtype = {inproceedings},\n author = {Moreira, Mayron C O and Arroyo, José E C and Januario, Tiago O and Oliveira, Paulo L},\n doi = {10.1109/HIS.2008.43},\n booktitle = {Proccedings of 8th International Conference on Hibrid Intelligent Systems}\n}</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  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.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"januario-arroyo-moreira-kampke-geneticlocalsearchalgorithmfortheminimumtotaltardinesspermutationflowshopproblem-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://ieeexplore.ieee.org/document/4625049/\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'januario-arroyo-moreira-kampke-geneticlocalsearchalgorithmfortheminimumtotaltardinesspermutationflowshopproblem-2008', 'http://ieeexplore.ieee.org/document/4625049/', event);\">\n    Genetic local search algorithm for the minimum total tardiness permutation flowshop problem.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Januario,  T., d., O.; Arroyo,  J., E., C.; <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., d., O.</a>;  and Kampke,  E., H.\n</span>\n\n  \n\n</span>\n\n  In <i>11th IEEE International Conference on Computational Science and Engineering</i>, pages 115-121,  2008. IEEE\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://ieeexplore.ieee.org/document/4625049/\"\n     onclick=\"log_download('januario-arroyo-moreira-kampke-geneticlocalsearchalgorithmfortheminimumtotaltardinesspermutationflowshopproblem-2008', 'http://ieeexplore.ieee.org/document/4625049/', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Genetic local search algorithm for the minimum total tardiness permutation flowshop problem [link]\"\n       title=\"Website\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Website</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/CSEW.2008.12\"\n     onclick=\"log_download('januario-arroyo-moreira-kampke-geneticlocalsearchalgorithmfortheminimumtotaltardinesspermutationflowshopproblem-2008', 'http://doi.org/10.1109/CSEW.2008.12', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/januario-arroyo-moreira-kampke-geneticlocalsearchalgorithmfortheminimumtotaltardinesspermutationflowshopproblem-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('januario-arroyo-moreira-kampke-geneticlocalsearchalgorithmfortheminimumtotaltardinesspermutationflowshopproblem-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{\n title = {Genetic local search algorithm for the minimum total tardiness permutation flowshop problem},\n type = {inproceedings},\n year = {2008},\n pages = {115-121},\n websites = {http://ieeexplore.ieee.org/document/4625049/},\n publisher = {IEEE},\n city = {Sao Paulo},\n institution = {IEEE},\n id = {5125e63a-d4f7-3ce5-9210-14f8a1ea2f0f},\n created = {2016-11-23T14:01:34.000Z},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2017-03-15T01:49:32.045Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n citation_key = {JanuarioEtAl_2008_ieee},\n source_type = {inproceedings},\n private_publication = {false},\n 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.},\n bibtype = {inproceedings},\n author = {Januario, Tiago de Oliveira and Arroyo, José Elias Claudio and Moreira, Mayron César de Oliveira and Kampke, Edmar Hell},\n doi = {10.1109/CSEW.2008.12},\n booktitle = {11th IEEE International Conference on Computational Science and Engineering}\n}</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  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.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"januario-arroyo-moreira-algoritmogenticocombuscalocalparaaminimizaodoatrasototaldastarefasnoproblemadeprogramaoflowshoppermutacionalcombufferzero-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  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.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Januario,  T., d., O.; Arroyo,  J., E., C.;  and <a class=\"bibbase author link\" href=\"https://bibbase.org/service/mendeley/134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8\">Moreira,  M., C., d., O.</a>\n</span>\n\n  \n\n</span>\n\n  <i>Revista Eletrônica de Iniciação Científica</i>, IV.  2008.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/januario-arroyo-moreira-algoritmogenticocombuscalocalparaaminimizaodoatrasototaldastarefasnoproblemadeprogramaoflowshoppermutacionalcombufferzero-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('januario-arroyo-moreira-algoritmogenticocombuscalocalparaaminimizaodoatrasototaldastarefasnoproblemadeprogramaoflowshoppermutacionalcombufferzero-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{\n 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},\n type = {article},\n year = {2008},\n volume = {IV},\n id = {d88f5779-e1e1-3da6-8578-6b655c2ac88d},\n created = {2016-11-23T16:10:39.000Z},\n file_attached = {false},\n profile_id = {134948fe-4bf0-3f08-9d61-f6cc9d0cdcb8},\n last_modified = {2017-03-15T01:49:32.045Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n citation_key = {Januario2008},\n private_publication = {false},\n bibtype = {article},\n author = {Januario, Tiago de Oliveira and Arroyo, José Elias Claudio and Moreira, Mayron César de Oliveira},\n journal = {Revista Eletrônica de Iniciação Científica}\n}</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n  </div>\n\n\n  <!-- Modal -->\n\n  <!-- <iframe id=\"bibbase_network_frame\" -->\n  <!--         src=\"//bibbase.org/network/control\" -->\n  <!--         style=\"display: none;\"> -->\n  <!-- </iframe> -->\n\n</div>\n"}; document.write(bibbase_data.data);