Improved dynamic programs for some batching problems involving the maximum lateness criterion

DOI10.1016/S0167-6377(00)00040-7zbMath0969.90049MaRDI QIDQ1593711

Albert P. M. Wagelmans, A. E. Gerodimos

Publication date: 4 October 2001

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

computational complexity; scheduling; dynamic programming; lateness; batching

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90B35: Deterministic scheduling theory in operations research

90C39: Dynamic programming