An Improved Branch-and bound Algorithm for the Job-shop Scheduling Problem of Minimising Makespan

  1. Lookup NU author(s)
Author(s)Waller L
Series Editor(s)Shaw B
Publication type Report
Series TitleComputing Laboratory Technical Report Series
Year1972
Legacy DateDecember 1972
Report Number40
Pages18
Full text is available for this publication:
InstitutionComputing Laboratory, The University of Newcastle upon Tyne
Place PublishedNewcastle upon Tyne
ActionsLink to this publication
Share