Search
Now showing items 21-24 of 24
Discrepancy search for the flexible job shop scheduling problem
(Elsevier, 2010-12)
The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop problem in which each operation must be processed on a given machine chosen among a finite subset of candidate machines. The aim ...
Flexible aircraft fleeting and routing at TunisAir
(Palgrave Macmillan, 2011-02)
This paper addresses a Flexible Aircraft Fleeting and Routing Problem, which is motivated by the Tunisian national carrier TunisAir. A solution to this problem specifies the departure time of each flight, the subset of ...
A branch-and-cut algorithm for the Steiner tree problem with delays
(Springer Science+Business Media, 2012-12)
In this paper, we investigate the Steiner tree problem with delays, which is a generalized version of the Steiner tree problem applied to multicast routing. For this challenging combinatorial optimization problem, we present ...
Solving the steiner tree problem with revenues, budget and hop constraints to optimality
(IEEE, 2013)
We investigate the Steiner tree problem with revenues, budget and hop constraints (STPRBH) on graph, which is a generalization of the well-known Steiner tree problem. Given a root node, edge costs, nodes revenues, as well ...
Share this page