A branch and bound algorithm to minimize total weighted tardiness on a single processor
From MaRDI portal
Publication:596449
DOI10.1023/B:ANOR.0000030680.29037.d0zbMath1056.90052OpenAlexW2060676778MaRDI QIDQ596449
Laurent Peridy, Pascal Babu, Éric Pinson
Publication date: 10 August 2004
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:anor.0000030680.29037.d0
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (4)
Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems ⋮ Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one ⋮ An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem
This page was built for publication: A branch and bound algorithm to minimize total weighted tardiness on a single processor
