Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem

DOI10.1007/11841036_6zbMath1131.90347OpenAlexW2593471869MaRDI QIDQ5449514

Monaldo Mastrolilli, Christoph Ambühl

Publication date: 11 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11841036_6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data

This page was built for publication: Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem