The problem of scheduling groups of jobs on a single machine under the group technology assumption is studied. Jobs of the same group are processed contiguously and a sequence ind...
T. C. Edwin Cheng, Mikhail Y. Kovalyov, C. T. Ng, ...
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
Finding a feasible solution of a given Mixed-Integer Programming (MIP) model is a very important (NP-complete) problem that can be extremely hard in practice. Very recently, Fisch...
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
We study the design of capacitated survivable networks using directed p-cycles. A p-cycle is a cycle with at least three arcs, used for rerouting disrupted flow during edge failur...