Search
Now showing items 1-10 of 24
Bounding strategies for the hybrid flow shop scheduling problem
(Elsevier, 2011-07-01)
In this paper, we investigate new lower and upper bounds for the multiple-center hybrid flow shop scheduling problem. We propose a family of center-based lower bounds as well as a destructive lower bound that is based on ...
Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search
(Elsevier, 2011-03)
This paper investigates how to adapt a discrepancy-based search method to solve two-stage hybrid flowshop scheduling problems in which each stage consists of several identical machines operating in parallel. The objective ...
A computational study of lower bounds for the two dimensional bin packing problem
(Elsevier, 2010-08-01)
We survey lower bounds for the variant of the two-dimensional bin packing problem where items cannot be rotated. We prove that the dominance relation claimed by Carlier et al. between their lower bounds and those of Boschetti ...
Robust aircraft routing and flight retiming
(Elsevier, 2010-08-01)
In this paper, we propose an integrated model for the robust aircraft routing and flight retiming problem. The model optimizes a slack-based robustness measure that explicitly takes heed of passengers in connection and ...
Strength of three MIP formulations for the prize collecting steiner tree problem with a quota constraint
(Elsevier, 2010-08-01)
This paper investigates the quota version of the Prize Collecting Steiner Tree Problem (PCSTP) on a graph as a generalization of the well-known Steiner tree problem. For this challenging network design problem that arises ...
Tight compact models and comparative analysis for the prize collecting Steiner tree problem
(Elsevier, 2013-03)
We investigate a generalized version of the prize collecting Steiner tree problem (PCSTP), where each node of a given weighted graph is associated with a prize as well as a penalty cost. The problem is to find a tree ...
Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem
(Elsevier, 2012-05)
We present new and effective lower bounds for the resource constrained project scheduling problem. This problem is widely known to be notoriously difficult to solve due to the lack of lower bounds that are both tight and ...
Relaxations and exact solution of the variable sized bin packing problem
(Springer Science+Business Media, 2011-03)
We address a generalization of the classical one-dimensional bin packing problem with unequal bin sizes and costs. We investigate lower bounds for this problem as well as exact algorithms. The main contribution of this ...
Exact method for robotic cell problem
(Elsevier, 2010-08-01)
This study investigates an exact method for the Robotic Cell Problem. We present an exact branch and bound algorithm which is the first exact procedure specifically designed for this strongly NP-hard problem. In this ...
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 ...
Share this page