article · 2004
ON A DOMINANCE TEST FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH RELEASE DATES TO MINIMIZE TOTAL FLOW TIME
The dominance test is a bounding operation in branch-and-bound algorithms, where each subproblem is examined whether it can be terminated or not by comparing...
3 citationsDOI: https://doi.org/10.15807/jorsj.47.96Open accessPDF reported by metadataFull text reported by metadata