Separation Algorithms for Single-Machine Scheduling with Precedence Constraints

Mahjoub, Ali Ridha; McCormick, S. Thomas

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érence

Date

2010

Titre du colloque

ISCO International Symposium on Combinatorial Optimization

Date du colloque

2010-03

Ville du colloque

Hammamet

Pays du colloque

Tunisie

Métadonnées

Afficher la notice complète

Auteur(s)

Mahjoub, Ali Ridha

McCormick, S. Thomas

Ré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."