Search
Now showing items 481-490 of 572
A simulation-optimization approach for robust aircraft routing
(
Universite de Lorraine
, 2015 , Conference Paper)
To mitigate the impact of unpredictable disruptions, airlines are seeking to pro-actively design schedules that incorporate some robustness features. In this paper, we propose a novel simulation-optimization approach using ...
MIP models for minimizing total tardiness in a two-machine flow shop
(
Palgrave Macmillan Ltd.
, 2013 , Article)
We propose compact mixed-integer programming models for the NP-hard problem of minimizing tardiness in a two-machine flow shop. Also, we propose valid inequalities that aim at tightening the models' representations. We ...
An assignment-based lower bound for a class of two-machine flow shop problems
(2013 , Article)
We present an assignment-based lower bound that is valid for a wide class of two-machine flow shop problems with a regular additive performance criterion. We provide empirical evidence that this new bound consistently ...
Solving a large-scale crew pairing problem
(
Palgrave Macmillan Ltd.
, 2015 , Article)
Airline companies seek to solve the problem of determining an assignment of crews to a pre-determined flight schedule with minimum total cost, called the Crew Pairing Problem (CPP). Most of the existing studies focus on ...
A model for enhancing robustness of aircraft and passenger connections
(
Elsevier
, 2013 , Article)
Airlines schedules are often subject to various uncontrollable factors that cause disruptions and delays. These delays not only constitute, for many passengers, the painful part of air travel, but also represent for airlines ...
Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles
(2013 , Article)
We investigate the minimum-weight connected subgraph problem. The importance of this problem stems from the fact that it constitutes the backbone of many network design problems having applications in several areas including ...
Improved bounds for hybrid flow shop scheduling with multiprocessor tasks
(2013 , Article)
In this paper, we investigate the problem of minimizing makespan in a multistage hybrid flow-shop scheduling with multiprocessor tasks. To generate high-quality approximate solutions to this challenging NP-hard problem, ...
Robust Resource Investment Problem with Time-Dependent Resource Cost and Tardiness Penalty
(
IEEE Computer Society
, 2016 , Conference Paper)
In this paper, the classical Resource Investment Problem (RIP) is extended to consider time-depended resource cost instead of time-independent resource cost. The problem is named as the Resource Investment Problem with ...
Optimization models for a single-plant District Cooling System
(
Elsevier
, 2015 , Article)
A District Cooling System (DCS) is an interconnected system encompassing a centralized chiller plant, a Thermal Energy Storage (TES) unit, a piping network, and clusters of consumers' buildings. The main function of a DCS ...
A branch-and-price algorithm for the two-stage guillotine cutting stock problem
(
Palgrave Macmillan Ltd.
, 2013 , Article)
We investigate the two-stage guillotine two-dimensional cutting stock problem. This problem commonly arises in the industry when small rectangular items need to be cut out of large stock sheets. We propose an integer ...