A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops

Yeong-Dae Kim. A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops. Computers & OR, 20(4):391-401, 1993. [doi]

Abstract

Abstract is missing.