Search
Now showing items 1-2 of 2
A branch-and-price-and-cut method for computing an optimal bramble
(Elsevier, 2015)
Given an undirected graph, a bramble is a set of connected subgraphs (called bramble elements) such that every pair of subgraphs either contains a common node, or such that an edge ( i , j ) exists with node i belonging ...
Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times
(Elsevier, 2022-09-16)
This paper studies a machine scheduling problem that minimizes the worst-case total tardiness for unrelated parallel machines with sequence-dependent setup and uncertain processing times. We propose a robust optimization ...
Share this page