Publication:5187059
From MaRDI portal
zbMath0561.90049MaRDI QIDQ5187059
Rolf H. Möhring, F. J. Radermacher
Publication date: 1985
single machine; polynomial time algorithm; precedence constraints; total weighted completion time; arbitrary processing times; weighted sum scheduling
90B35: Deterministic scheduling theory in operations research
Related Items
Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation, On some complexity properties of N-free posets and posets with bounded decomposition diameter, Single machine scheduling with precedence constraints and positionally dependent processing times