The cyclical scheduling problem
From MaRDI portal
Publication:744050
Recommendations
Cites work
- scientific article; zbMATH DE number 3496213 (Why is no real title available?)
- scientific article; zbMATH DE number 3637616 (Why is no real title available?)
- scientific article; zbMATH DE number 795216 (Why is no real title available?)
- scientific article; zbMATH DE number 1433426 (Why is no real title available?)
- A polynomial algorithm for b-matchings: An alternative approach
- An efficient two-phase algorithm for cyclic days-off scheduling.
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Cyclic Scheduling via Integer Programs with Circular Ones
- Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms
- Maximum matching and a polyhedron with 0,1-vertices
- Optimal Scheduiing of Two Consecutive Idle Periods
- Optimizing over Consecutive 1's and Circular 1's Constraints
- The cyclical scheduling problem
- Unnetworks, with Applications to Idle Time Scheduling
Cited in
(9)- The cyclical scheduling problem
- scientific article; zbMATH DE number 6971075 (Why is no real title available?)
- Integral cycle bases for cyclic timetabling
- Fixed Cycle Scheduling: A Solvable Problem with Empty Precedence Structure
- The Deterministic Dynamic Product Cycling Problem
- The basic cyclic scheduling problem with deadlines
- Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms
- Recovering cyclic schedules from delay
- Scheduling cyclic tasks with binary periods
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)