Benders decomposition uses a strategy of``learning from one's mistakes.''The aim of this
paper is to extend this strategy to a much larger class of problems. The key is to generalize …

Parallel machine scheduling problems have many practical and industrial applications. In
this paper we study a generalization which is the unrelated parallel machine scheduling …

In this paper, we investigate a variant of the unrelated parallel machine scheduling problem
with multiple time windows that is widely employed in the scheduling of earth observation …

This paper deals with the Unrelated Parallel Machine scheduling problem with Setups and
Resources (UPMSR) with the objective of minimizing makespan. Processing times and …

This paper presents exact algorithms based on logic-based Benders decomposition and a
variant, called branch-and-check, for the heterogeneous fixed fleet vehicle routing problem …

We investigate the discrete parallel machine scheduling and location problem, which
consists of locating multiple machines to a set of candidate locations, assigning jobs from …

We study a generalized operating room planning and scheduling (GORPS) problem at the
Toronto General Hospital (TGH) in Ontario, Canada. GORPS allocates elective patients and …

In this paper, we study an important real-life scheduling problem that can be formulated as
an unrelated parallel machine scheduling problem with sequence-dependent setup times …

We develop three novel logic-based Benders' decomposition (LBBD) approaches and a cut
propagation mechanism to solve large-scale location-allocation integer programs (IPs). We …

Abstract The Parallel Machine Scheduling Problem (PMSP) has undergone significant
development in academic literature. The most recent comprehensive review of published …