SCHEDULING PROBLEMS WITH PRECEDENCE CONSTRAINTS: MODELS AND ALGORITHMS

被引：0

作者：

Montemanni, Roberto ^{[1
]}

机构：

[1] Univ Appl Sci Southern Switzerland SUPSI, Dalle Molle Inst Artificial Intelligence IDSIA, CH-6928 Manno, Switzerland

来源：

EUROPEAN SIMULATION AND MODELLING CONFERENCE 2012 | 2012年

关键词：

Sequential ordering problem; scheduling problems; precedence constraints; mixed integer linear programming; optimization algorithms; SEQUENTIAL ORDERING PROBLEM;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：5 / 12

页数：8

共 10 条

[1]

[Anonymous], THESIS TU BERLIN

[2]

Boschetti M, 2009, ANN INFORM SYST, V10, P135, DOI 10.1007/978-1-4419-1306-7_5

[3] An ant colony system hybridized with a new local search for the sequential ordering problem [J].