Scheduling in the context of spatial decision problems can be thought of as a special case of selection and allocation problems in which temporal constraints also are important. A typical example of this type of problem is timber-harvest scheduling, in which there are constraints on both the types and timing of activities that can be implemented in neighboring units. These types of problems almost always involve at least neighborhood-level spatial computation, and most problems are formulated as optimization problems.
Graphical Ontology Browser
- Click on a node to jump to the content of that node
- Pan to see the rest of the graph
- Scroll the mousewheel up and down to zoom in and out
- Rearrange the nodes in the graph by dragging a node to a different position