Scheduling the General Job-Shop
描述了一类用于寻找作业车间最优调度的分支定界算法，每个搜索树节点关联一个完整调度，基于调度中的关键冲突进行分支，并给出了一些结果。
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.