The circular balancing problem
From MaRDI portal
Cites work
- A note on cake cutting
- Algorithmic graph theory and perfect graphs
- Algorithmic solutions for envy-free cake cutting
- Approximate solutions to the turbine balancing problem.
- Complexity of min-max subsequence problems
- Cyclic scheduling of offweekends
- Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane
- Grouping tasks to save energy in a cyclic scheduling problem: a complexity study
- Heuristic algorithms for a turbine-blade-balancing problem
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1234106 (Why is no real title available?)
- Linear time computation of the maximal linear and circular sums of multiple independent insertions into a sequence
- Off-Day Scheduling with Hierarchical Worker Categories
- On the complexity of cake cutting
- On the longest increasing subsequence of a circular list
- On the parameterized tractability of single machine scheduling with rejection
- Pattern avoidance of \([4,k]\)-pairs in circular permutations
- Robust cyclic berth planning of container vessels
- Some complexity results about threshold graphs
- Technical Note—Optimal Scheduling of Periodic Activities
- The complexity of a cyclic scheduling problem with identical machines and precedence constraints
- The design of approximation algorithms
- The replenishment schedule to minimize peak storage problem: the gap between the continuous and discrete versions of the problem
This page was built for publication: The circular balancing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982445)
