A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities
From MaRDI portal
Publication:3423262
DOI10.1002/nav.20118zbMath1106.90030MaRDI QIDQ3423262
Jonathan F. Bard, Siwate Rojanasoonthon
Publication date: 20 February 2007
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20118
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B35: Deterministic scheduling theory in operations research
Related Items
A branch-and-price algorithm for stable workforce assignments with hierarchical skills, The concrete delivery problem, Optimal solutions for a dock assignment problem with trailer transportation, 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, Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling, Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria, Scheduling multiple products on parallel machines with setup costs
Cites Work
