Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families

DOI10.1016/j.cor.2019.02.012zbMath1458.90325MaRDI QIDQ1734827

Yan-Li Huang, Xiao-Lin Li, Yupeng Li

Publication date: 27 March 2019

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

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

zbMATH Keywords

heuristics; lower bound; batch processing machine; maximum lateness; job families

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

90B30: Production models

Uses Software

• CPLEX