Many-to-many assignment problems: Lagrangian bounds and heuristic

Capítulos de libros

Fecha

2011-12-01

Registro en:

Innovation in Power, Control, and Optimization: Emerging Energy Technologies, p. 220-247.

http://hdl.handle.net/11449/220161

10.4018/978-1-61350-138-2.ch007

2-s2.0-84901561312

https://repositorioslatinoamericanos.uchile.cl/handle/2250/5400290

Autor

Nuevo Leon State University

Universidade Estadual Paulista (UNESP)

Institución

Universidade Estadual Paulista (Brasil)

Resumen

Modified Lagrangian bounds and a greedy heuristic are proposed for many-to-many assignment problems taking into account capacity limits for tasks and agents. A feasible solution recovered by the heuristic is used to speed up the subgradient technique to solve the modified Lagrangian dual. A numerical study is presented to compare the quality of the bounds and to demonstrate the efficiency of the overall approach. © 2012, IGI Global.

Materias

Mostrar el registro completo del ítem