The sequential ordering problem is a basic scheduling problem with precedence constraints. It can be used to model many real world applications arising in different fields in terms of combinatorial optimization. In this paper we review two approaches to the problem recently appeared in the literature. Both the methods are based on a mixed integer linear programming, which is in turn introduced and discussed. Experimental results are presented to analyze the performance of the algorithms. © 2012 EUROSIS-ETI.
Scheduling problems with precedence constraints: Models and algorithms / Montemanni, R.. - (2012), pp. 5-12. (Intervento presentato al convegno 26th European Simulation and Modelling Conference, ESM 2012 tenutosi a Essen, deu nel 2012).
Scheduling problems with precedence constraints: Models and algorithms
Montemanni R.
2012
Abstract
The sequential ordering problem is a basic scheduling problem with precedence constraints. It can be used to model many real world applications arising in different fields in terms of combinatorial optimization. In this paper we review two approaches to the problem recently appeared in the literature. Both the methods are based on a mixed integer linear programming, which is in turn introduced and discussed. Experimental results are presented to analyze the performance of the algorithms. © 2012 EUROSIS-ETI.
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
