A total tardiness problem with preprocessing included
From MaRDI portal
Publication:5687645
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6750(199608)43:5<721::AID-NAV8>3.0.CO;2-7" /><721::AID-NAV8>3.0.CO;2-7 10.1002/(SICI)1520-6750(199608)43:5<721::AID-NAV8>3.0.CO;2-7zbMath0868.90066OpenAlexW2013919706MaRDI QIDQ5687645
Publication date: 21 January 1997
Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199608)43:5<721::aid-nav8>3.0.co;2-7
branch-and-boundpolynomial-time heuristicaverage job completion timetwo-machine flow-shop total tardiness problem
Related Items (1)
This page was built for publication: A total tardiness problem with preprocessing included
