Parallel branch-and-bound methods for the job-shop scheduling problem

DOI10.1023/A:1018903912673zbMath0911.90218OpenAlexW1601778723MaRDI QIDQ1273123

Michael Perregaard, Jens Clausen

Publication date: 6 December 1998

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018903912673

zbMATH Keywords

job-shop schedulingparallel branch-and-bound algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Parallel numerical computation (65Y05)

Related Items (5)

A neighborhood for complex job shop scheduling problems with regular objectives ⋮ Theoretical expectation versus practical performance of Jackson's heuristic ⋮ 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 ⋮ Fast parallel heuristics for the job shop scheduling problem ⋮ Deterministic job-shop scheduling: Past, present and future

This page was built for publication: Parallel branch-and-bound methods for the job-shop scheduling problem