Augmentations of consistent partial orders for the one-machine total tardiness problem
From MaRDI portal
Publication:1917355
DOI10.1016/0166-218X(95)00051-RzbMath0846.90058MaRDI QIDQ1917355
Publication date: 7 July 1996
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
total tardiness; one-machine scheduling; Emmons' dominance theorem; partial order on a job set; proper augmentations
06A07: Combinatorics of partially ordered sets
90B35: Deterministic scheduling theory in operations research
Related Items
Necessary and sufficient conditions of optimality for some classical scheduling problems, The single-machine total tardiness scheduling problem: review and extensions, Minimizing total tardiness in a scheduling problem with a learning effect
Cites Work