Search
Now showing items 11-20 of 24
Robust scheduling and robustness measures for the discrete time/cost trade-off problem
(Elsevier, 2010-12-01)
Projects are often subject to various sources of uncertainties that have a negative impact on activity durations and costs. Therefore, it is crucial to develop effective approaches to generate robust project schedules that ...
A benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture
(Springer Science+Business Media, 2013-11)
The airline’s ability to offer flight schedules that provide service to passengers at desired times in competitive markets, while matching demand with an aircraft fleet of suitable size and composition, can significantly ...
Development of lower bounds for the scheduling of setup tasks in serial production lines
(Inderscience Publishers, 2013)
Efficient production resettings are necessary to achieve production flexibility. For this reason, it is of primary importance to reduce the setup time required to switch the production from one product type to another, and ...
IP-based energetic reasoning for the resource constrained project scheduling problem
(Elsevier, 2010-08-01)
In this paper, we consider the Resource Constrained Project Scheduling Problem (RCPSP). New feasibility tests for the energetic reasoning are introduced based on new integer programming (IP) formulations. Experimental ...
Discrete time/cost trade-off problem: a decomposition-based solutionalgorithm for the budget version
(Elsevier, 2010-04)
This paper investigates the budget variant of the discrete time/cost trade-off problem (DTCTP). This multi-mode project scheduling problem requires assigning modes to the activities of a project so that the total completion ...
The Steiner tree problem with delays: a compact formulation and reduction procedures
(Elsevier, 2014-02-19)
This paper investigates the Steiner Tree Problem with Delays (STPD), a variation of the classical Steiner Tree problem that arises in multicast routing. We propose an exact solution approach that is based on a polynomial-size ...
Algorithmic expedients for the prize collecting Steiner tree problem
(Elsevier, 2010)
This paper investigates the Prize Collecting Steiner Tree Problem (PCSTP) on a graph, which is a generalization of the well-known Steiner tree problem. Given a root node, edge costs, node prizes and penalties, as well as ...
Exact approaches for integrated aircraft fleeting and routing at TunisAir
(Science+Business Media, 2011-06)
We describe models and exact solutions approaches for an integrated aircraft fleeting and routing problem arising at TunisAir. Given a schedule of flights to be flown, the problem consists of determining a minimum cost ...
Exact methods for the robotic cell problem
(Springer Science+Business Media, 2011-06)
This paper investigates an exact method for the Robotic Cell Problem. We present a branch-and-bound algorithm which is the first exact procedure specifically designed with regard to this complex flow shop scheduling variant. ...
An exact algorithm for the Steiner tree problem with delays
(Elsevier, 2010-08-01)
The Steiner Tree Problem with Delays (STPD) is a variant of the well-known Steiner Tree Problem in which the delay on each path between a source node and a terminal node is limited by a given maximum value. We propose a ...
Share this page