Search
Now showing items 1-5 of 5
Integrated airline schedule design and fleet assignment: polyhedral analysis and benders’ decomposition approach
(Informs, 2010-01)
The main airline operations consist of schedule planning, fleet assignment, aircraft routing, and crew scheduling. To improve profitability, we present in this paper an integrated fleet assignment model with schedule ...
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 ...
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 ...
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 ...
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 ...
Share this page