A review of three decades of research on some combinatorial optimization problems

Pesquisa Operacional

Horacio Hideki Yanasse¹ 

[1] ,Instituto Nacional de Pesquisas EspaciaisSão José dos Campos SP ,Brasil

关键词: review;    works by HHYanasse;    combinatorial optimization;   

DOI  :  10.1590/S0101-74382013000100002

来源: SciELO

【 摘 要 】

This paper presents an overview of our research in combinatorial optimization problems. Over the last three decades, our team has been studying mostly optimization problems that arise in industrial environments through the elaboration and solution of mathematical decision models. In addition to elaborating innovative models, we have improved upon existing solutions to complex problems, helping decision makers and researchers to better understand complex industrial systems. Our work has focused on the development of computationally more efficient algorithms that improve on existing methods by improving the solution quality or reducing the computation effort to obtain good solutions. While some of our earlier work became less necessary with the speed up of the computational facilities, the search for improved solution quality and reduced computational effort continues. After reviewing our findings on lot sizing, production scheduling, cutting problems, pattern sequencing, tool switches in flexible manufacturing machines and integrated cutting and sequencing problems, we propose topics for future study.

【 授权许可】

CC BY   
 All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License