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.
2012
ICAOR 2012
Bangkok Thailand
July 2012
4
266
273
Mojana, Marco; Montemanni, Roberto; Di Caro, Gianni; Gambardella Luca, M
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).
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

Licenza Creative Commons
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

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/1176626
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact