Many different real problems can be modeled in mathematical terms as a Sequential Ordering Problem. This combinatorial optimization problem can be seen as a scheduling problem with precedence constraints among the jobs. In the present paper a branch and bound method that exploits the structure of the precedence constraints is introduced and tested on some benchmark instances commonly adopted in the literature.
A branch and bound approach for the sequential ordering problem / Mojana, Marco; Montemanni, Roberto; Di Caro, Gianni; Gambardella Luca, M. - 4:(2012), pp. 266-273. (Intervento presentato al convegno ICAOR 2012 tenutosi a Bangkok Thailand nel July 2012).
A branch and bound approach for the sequential ordering problem
Montemanni Roberto;
2012
Abstract
Many different real problems can be modeled in mathematical terms as a Sequential Ordering Problem. This combinatorial optimization problem can be seen as a scheduling problem with precedence constraints among the jobs. In the present paper a branch and bound method that exploits the structure of the precedence constraints is introduced and tested on some benchmark instances commonly adopted in the literature.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
