The cyclical scheduling problem

DOI10.1016/j.tcs.2014.03.034zbMath1360.90151OpenAlexW2121556262MaRDI QIDQ744050

Ramesh Krishnamurti, Soudipta Chakraborty, Ehsan Iranmanesh, Binay K. Bhattacharya

Publication date: 6 October 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.03.034

zbMATH Keywords

network flow\(b\)-matchingcyclic schedulingweighted matchingbalanced binary tree

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic network models in operations research (90B10) Theory of organizations, manpower planning in operations research (90B70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms
• A polynomial algorithm for b-matchings: An alternative approach
• An efficient two-phase algorithm for cyclic days-off scheduling.
• Optimizing over Consecutive 1's and Circular 1's Constraints
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Cyclic Scheduling via Integer Programs with Circular Ones
• Unnetworks, with Applications to Idle Time Scheduling
• The Cyclical Scheduling Problem
• Maximum matching and a polyhedron with 0,1-vertices
• Optimal Scheduiing of Two Consecutive Idle Periods

This page was built for publication: The cyclical scheduling problem