Scheduling the General Job-Shop
- 1 May 1985
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 31 (5) , 594-598
- https://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.production/scheduling: job shop, deterministicKeywords
This publication has 0 references indexed in Scilit: