Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs
From MaRDI portal
Publication:3160580
DOI10.1057/jors.2008.123zbMath1196.90047MaRDI QIDQ3160580
No author found.
Publication date: 14 October 2010
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.2008.123
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B35: Deterministic scheduling theory in operations research
Related Items
Modeling the parallel machine scheduling problem with step deteriorating jobs, Single machine group scheduling with decreasing time-dependent processing times subject to release dates, Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs, A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs