Separation Algorithms for Single-Machine Scheduling with Precedence Constraints
Mahjoub, Ali Ridha; McCormick, S. Thomas (2010), Separation Algorithms for Single-Machine Scheduling with Precedence Constraints, ISCO International Symposium on Combinatorial Optimization, 2010-03, Hammamet, Tunisie
Type
Communication / ConférenceDate
2010Titre du colloque
ISCO International Symposium on Combinatorial OptimizationDate du colloque
2010-03Ville du colloque
HammametPays du colloque
TunisieMétadonnées
Afficher la notice complèteRésumé (EN)
In a 1991 paper M. Queyranne and Y. Wang proposed three classes of valid inequalities for the classic problem of scheduling a single machine with precedence constraints. These constraints are called "parallel constraints", "series constraints", and "Z constraints". It has been understood for a long time how to separate parallel constraints using submodular function minimization, or even just min cut, but separating series constraints has remained open since that time. We give a fast, practical separation algorithm for series constraints. It is based on parametric min cut algorithms. We also investigate separation of "Z constraints."Mots-clés
ConstraintsPublications associées
Affichage des éléments liés par titre et auteur.
-
Mahjoub, Ali Ridha; McCormick, S. Thomas (2010) Article accepté pour publication ou publié
-
Aissi, Hassene; Mahjoub, Ali Ridha; McCormick, S. Thomas; Queyranne, Maurice (2014) Communication / Conférence
-
Pesneau, Pierre; Mahjoub, Ali Ridha; McCormick, S. Thomas; Fortz, bernard (2006) Article accepté pour publication ou publié
-
Kacem, Imed; Mahjoub, Ali Ridha (2009) Article accepté pour publication ou publié
-
Mahjoub, Ali Ridha; Lacroix, Mathieu; Kerivin, Hervé (2010) Communication / Conférence