Search
Now showing items 1-3 of 3
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 ...
Next-day operating room scheduling with uncertain surgery durations: Exact analysis and heuristics
(Elsevier, 2020-10-01)
Operating rooms are units of particular interest in hospitals as they constitute more than 40% of total expenses and revenues. Managing operating rooms is challenging due to conflicting priorities and preferences of various ...
Share this page