A Branch-bound-and-imply Algorithm for an Improved Attack Upon the Job-shop Scheduling Problem

  1. Lookup NU author(s)
Author(s)Waller L
Series Editor(s)Shaw B
Publication type Report
Series TitleComputing Laboratory Technical Report Series
Source Publication DateMay 1973
Report Number48
Full text is available for this publication:
In branch-and-bound approaches to discrete optimization problems the calculation of lower bounds often assumes certain relations about the behaviour of unassigned variables. Consideration of such behaviour can allow constraints to be imposed upon the space still to be examined with the effect that the performance of the search can be improved. A job-shop scheduling problem is considered here in order to illustrate a potential curtailment of the 'combinatorial explosion' so frequently encountered with such problems.
InstitutionComputing Laboratory, The University of Newcastle upon Tyne
Place PublishedNewcastle upon Tyne
ActionsLink to this publication