Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system

DOI10.1016/j.cor.2016.12.001zbMath1391.90302MaRDI QIDQ1652207

Y. Aharonov

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.12.001

zbMATH Keywords

dynamic programming; branch and bound; heuristic; batch processing machine; just-in-time scheduling

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

90C39: Dynamic programming