Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Variable neighborhood search heuristics for a test assembly design problem

Autor
Pereira, J.; Vila, M.
Tipus d'activitat
Article en revista
Revista
Expert systems with applications
Data de publicació
2015-06-15
Volum
42
Número
10
Pàgina inicial
4805
Pàgina final
4817
DOI
https://doi.org/10.1016/j.eswa.2015.01.057 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/28210 Obrir en finestra nova
URL
http://www.sciencedirect.com/science/article/pii/S0957417415000809# Obrir en finestra nova
Resum
Test assembly design problems appear in the areas of psychology and education, among others. The goal of these problems is to construct one or multiple tests to evaluate the test subject. This paper studies a recent formulation of the problem known as the one-dimensional minimax bin-packing problem with bin size constraints (MINIMAX_BSC). In the MINIMAX_BSC, items are initially divided into groups and multiple tests need to be constructed using a single item from each group, while minimizing dif...
Citació
Pereira, J.; Vila, M. Variable neighborhood search heuristics for a test assembly design problem. "Expert systems with applications", 15 Juny 2015, vol. 42, núm. 10, p. 4805-4817.
Paraules clau
Bin packing, Test assembly design, Test splitting, Variable neighborhood search
Grup de recerca
OPE-PROTHIUS - Organització de la Producció en Tallers Híbrids

Participants

Arxius