Reformulation-linearization technique for modelling scheduling decisions

Maldonado, Michelli; Rangel, Socorro; Clark, Alistair

Authors

Michelli Maldonado

Socorro Rangel

Alistair Clark

Contributors

R Z
Editor

J F Camacho-Vallejo
Editor

J L
Editor

Miguel Laguna
Editor

Abstract

The objective of this work is to discuss the use of formulations for the Asymmetric Traveling Salesman Problem for modelling the scheduling decisions in a big bucket approach for the integrated lot sizing and scheduling problem. We apply the Reformulation-Linearization Technique to derive tight constraints and use them to replace the Miller-Tucker and Zemlim type constraints. The new model is studied and compared to two other formulations already used in the literature. The results show that the proposed valid inequalities are useful to obtain tighter dual bounds and thus improve the solution process.

Citation

Maldonado, M., Rangel, S., & Clark, A. (2014). Reformulation-linearization technique for modelling scheduling decisions. In R. Z. Ríos-Mercado, J. F. Camacho-Vallejo, J. L. González-Velarde, & M. Laguna (Eds.), Recent Advances in Theory, Methods, and Practice of Operations Research (128-135). Monterrey, Mexico: UANL - Casa Universitaria del Libro

Publication Date	Jan 1, 2014
Peer Reviewed	Peer Reviewed
Pages	128-135
Book Title	Recent Advances in Theory, Methods, and Practice of Operations Research
ISBN	9786072703575
Keywords	lot scheduling, asymmetric traveling salesman problem, reformulation-linearization technique, tight relaxations
Publisher URL	http://editorialuniversitaria.uanl.mx/index.php/casauniversitaria/