SciELO - Scientific Electronic Library Online

 
vol.24 número3A methodology to filter time series: application to minute-by-minute electric load seriesUm parâmetro urbano global como referência para análises locais em modelos de locação-alocação índice de autoresíndice de assuntospesquisa de artigos
Home Pagelista alfabética de periódicos  

Serviços Personalizados

Journal

Artigo

Indicadores

Links relacionados

Compartilhar


Pesquisa Operacional

versão impressa ISSN 0101-7438versão On-line ISSN 1678-5142

Resumo

SILVA, Tânia Cordeiro Lindbeck da; STEINER, Maria Teresinha Arns; CARNIERI, Celso  e  SILVA, Arinei Carlos Lindbeck da. Determinação de escalas de plantão para militares considerando preferências e hierarquia. Pesqui. Oper. [online]. 2004, vol.24, n.3, pp.373-391. ISSN 1678-5142.  http://dx.doi.org/10.1590/S0101-74382004000300003.

The goal of this paper is to present a Binary Integer Linear Programming (BILP) model to solve a AIR FORCE soldiers rostering problem in order to define duty service days for each soldier, considering his or her preferences and military hierarchy rules as well. For the formulation and solving of the BILP problem, a computational program has been developed to serve as an interface between the user and LINGO software, which was used to solve the BILP model. In order to validate the model, many simulations were conducted, using different number of soldiers, weights (priority degrees), daily demands, scales types and the eventual need for having soldiers on call. The results were considered acceptable, by comparing the optimized scales with the ones in use on the occasion of the data collection (those were based on worker's experience). The mathematical model developed can easily be adapted and applied to any kind of military force, due to their similar characteristics.

Palavras-chave : binary integer linear programming; optimization procedure; rostering.

        · resumo em Português     · texto em Português     · Português ( pdf )

 

Creative Commons License Todo o conteúdo deste periódico, exceto onde está identificado, está licenciado sob uma Licença Creative Commons