Answers are grounded in this paper and cite their sources.
Explores conflict-based scheduling in job-shops, suggesting improved efficiencies.
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.
No takes yet. Share an insight, caveat, or question.
Barker et al. (1985) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: