Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems

DOI10.1007/BF02564710zbMath0978.90045MaRDI QIDQ1304770

Ramon Companys

Publication date: 12 February 2002

Published in: Top (Search for Journal in Brave)

zbMATH Keywords

schedulingbranch-and-bound

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems

Cites Work

• An adaptive branching rule for the permutation flow-shop problem
• An Evaluation of Flow Shop Sequencing Heuristics
• Elimination methods in them ×n sequencing problem

This page was built for publication: Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems