Semi-definite relaxation algorithm for single machine scheduling with controllable processing times
From MaRDI portal
Publication:1774270
DOI10.1142/S0252959905000142zbMath1211.90078MaRDI QIDQ1774270
Publication date: 29 April 2005
Published in: Chinese Annals of Mathematics. Series B (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
This page was built for publication: Semi-definite relaxation algorithm for single machine scheduling with controllable processing times