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.90047OpenAlexW1976916754MaRDI QIDQ3160580
No author found.
Publication date: 14 October 2010
Published in: Unnamed Author (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.2008.123
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (5)
Modeling the parallel machine scheduling problem with step deteriorating jobs ⋮ A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs ⋮ Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs ⋮ Single machine group scheduling with decreasing time-dependent processing times subject to release dates ⋮ Two-agent single-scheduling problems of proportionally-linear deteriorated jobs with the maxi-and-total cost criteria
This page was built for publication: Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs
