The cyclical scheduling problem
DOI10.1016/J.TCS.2014.03.034zbMATH Open1360.90151OpenAlexW2121556262MaRDI QIDQ744050FDOQ744050
Authors: Soudipta Chakraborty, Ehsan Iranmanesh, Ramesh Krishnamurti, Binay 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
Recommendations
Analysis of algorithms (68W40) Deterministic network models in operations research (90B10) Theory of organizations, manpower planning in operations research (90B70)
Cites Work
- Title not available (Why is that?)
- Maximum matching and a polyhedron with 0,1-vertices
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- A polynomial algorithm for b-matchings: An alternative approach
- Cyclic Scheduling via Integer Programs with Circular Ones
- Title not available (Why is that?)
- The cyclical scheduling problem
- Title not available (Why is that?)
- An efficient two-phase algorithm for cyclic days-off scheduling.
- Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms
- Title not available (Why is that?)
- Optimizing over Consecutive 1's and Circular 1's Constraints
- Unnetworks, with Applications to Idle Time Scheduling
- Optimal Scheduiing of Two Consecutive Idle Periods
Cited In (9)
- Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms
- Title not available (Why is that?)
- Scheduling cyclic tasks with binary periods
- The cyclical scheduling problem
- The basic cyclic scheduling problem with deadlines
- Integral cycle bases for cyclic timetabling
- The Deterministic Dynamic Product Cycling Problem
- Recovering cyclic schedules from delay
- Fixed Cycle Scheduling: A Solvable Problem with Empty Precedence Structure
This page was built for publication: The cyclical scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744050)
