In this article, we address the preemptive resource-constrained precedence scheduling problem. We propose two mixed integer formulations containing an exponential number of variables and inequalities. An antichain is ...
详细信息
In this article, we address the preemptive resource-constrained precedence scheduling problem. We propose two mixed integer formulations containing an exponential number of variables and inequalities. An antichain is a set of pairwise incomparable elements with respect to the precedence constraints. In the first formulation, the integer variables are associated with the antichains. For the second, the integer variables are limited to a particular subset of antichains. We propose two Branchand-Cut-and-Price algorithms for each of these formulations. We introduce some valid inequalities in order to reinforce the second formulation. Finally, we give some computational results on instances of the PSPLIB and compare the formulations.
暂无评论