Mixed Graph Problems
1994
All of the situations considered earlier can be interpreted in terms of resource-constrained project scheduling. To do so, we introduce the concept of an Operation as some process having a certain duration and consuming certain resources. Each two operations may be either dependent or independent in the sense that the calendar time of one of them either affects or does not affect that of another. Each machine may be considered as a non-accumulated indivisible resource which restricts the possibility of performing two or more operations of job processing simultaneously.
Keywords:
- Coxeter graph
- Real-time computing
- Butterfly graph
- Quartic graph
- Voltage graph
- Edge-transitive graph
- Strength of a graph
- Factor-critical graph
- Computer science
- Simplex graph
- Graph property
- Graph (abstract data type)
- Mixed graph
- Null graph
- Mathematical optimization
- Schedule (project management)
- Line graph
- Flow shop scheduling
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI