Scheduling the General Job-Shop
Published Online:1 May 1985https://doi.org/10.1287/mnsc.31.5.594
Abstract
A family of algorithms is described for finding optimum schedules for job-shops. The algorithms are of a branch and bound type but have a complete schedule associated with each node of the search tree. Branching from nodes is based on important conflicts in the schedule. Some results are provided.
