Lower bounds for parallel machine scheduling problems
From MaRDI portal
Publication:947338
DOI10.1504/IJOR.2008.019731zbMath1144.90376OpenAlexW2107539660MaRDI QIDQ947338
Antoine Jouglet, David Savourey, Philippe Baptiste
Publication date: 2 October 2008
Published in: International Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1504/ijor.2008.019731
Related Items (6)
Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions ⋮ Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time ⋮ Dynamic scheduling of patients in emergency departments ⋮ A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals ⋮ Multi-machine scheduling lower bounds using decision diagrams ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
This page was built for publication: Lower bounds for parallel machine scheduling problems
