Scheduling the General Job-Shop
Jeffrey R. Barker, Graham B. McMahon
Management Science · 1985 · Volume 31 · Issue 5
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.
Keywords
production/scheduling: job shop, deterministic
Enable JavaScript for citation tools and additional paper interactions.