NASA NTRS · 20060029871
Solving large scheduling problems by coordinating specialized sub-problem solvers
Abstract
This paper describes a simple method for integrating certain kinds of combinatorial sub-problem solvers within a general purpose planner/scheduler framework that demonstrably increases solution speed and quality.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Knight, R., Smith, B. D.. 2002-10-27. Solving large scheduling problems by coordinating specialized sub-problem solvers. https://engineeringpapers.com/record/nasa%3A20060029871/solving-large-scheduling-problems-by-coordinating-specialized-sub-problem-solvers
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Engineering Papers by Indiciae: BibTeX · RIS.