Now showing items 1-7 of 7
Bounding strategies for the hybrid flow shop scheduling problem
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
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
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 ...
Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem
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 ...
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 ...
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. ...
Share this page