An allocation rule for connection scheduling problems
From MaRDI portal
Cites work
- A new rule for source connection problems
- A non-cooperative approach to the cost spanning tree problem.
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
- Cost allocation for a spanning tree
- Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
- scientific article; zbMATH DE number 1090983 (Why is no real title available?)
- Intelligent optimal demand response implemented by blockchain and cooperative game in microgrids
- Job sequencing with uncertain and controllable processing times
- Minimum cost spanning tree games
- On the convexity of precedence sequencing games
- On the core and nucleolus of minimum cost spanning tree games
- On the core of cost-revenue games: minimum cost spanning tree games with revenues
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Optimal Linear Ordering
- Sequencing games
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- Sequencing situations with position-dependent effects under cooperation
- Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties
- Survey of scheduling research involving due date determination decisions
- The P-value for cost sharing in minimum
- The split core for sequencing games
This page was built for publication: An allocation rule for connection scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6918555)
