The relation of time indexed formulations of single machine scheduling problems to the node packing problem

DOI10.1007/s10107-002-0335-9zbMath1023.90032OpenAlexW2059970089MaRDI QIDQ1396279

Paolo Nobili, Savelsbergh, Martin W. P., Ellis L. Johnson, Hamish Waterer

Publication date: 30 June 2003

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-002-0335-9

zbMATH Keywords

polyhedral methodsfacet inducing inequalitiesnode packingfacet defining graphslifted valid inequalitiesnonpreemptive single machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items

Fixed interval scheduling: models, applications, computational complexity and algorithms, A computational study of a cutting plane algorithm for university course timetabling, Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem, A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems, Scheduling of tasks with effectiveness precedence constraints, Scheduling two chains of unit jobs on one machine: A polyhedral study, Dynamic node packing, On a fix-and-relax framework for a class of project scheduling problems