Scheduling with job-splitting considering learning and the vital-few law
From MaRDI portal
Publication:1652529
DOI10.1016/j.cor.2017.02.011zbMath1391.90285MaRDI QIDQ1652529
Chein-Shan Liu, Li Zheng, Zhi-Hai Zhang, Chenjie Wang
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.2017.02.011
makespan; parallel machine scheduling; worst-case analysis; learning effect; job splitting; vital-few law
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming