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
TypeCommunication / Conférence
Conference titleISCO International Symposium on Combinatorial Optimization
MetadataShow full item record
Abstract (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."
Subjects / KeywordsConstraints
Showing items related by title and author.
Pesneau, Pierre; Mahjoub, Ali Ridha; McCormick, S. Thomas; Fortz, bernard (2006) Article accepté pour publication ou publié
Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval Kacem, Imed; Mahjoub, Ali Ridha (2009) Article accepté pour publication ou publié