Publication:5852550
From MaRDI portal
zbMath1179.90328MaRDI QIDQ5852550
M. Aramon-Bajestani, Reza Tavakkoli-Moghaddam
Publication date: 27 January 2010
branch-and-bound algorithm; sequence-dependent setup times; total weighted tardiness; parallel machines scheduling
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B35: Deterministic scheduling theory in operations research
Related Items
The third comprehensive survey on scheduling problems with setup times/costs, Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm