The complexity of a cyclic scheduling problem with identical machines and precedence constraints

DOI10.1016/0377-2217(95)00110-7zbMath0924.90095MaRDI QIDQ1278237

K. Appert

Publication date: 1996

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00110-7

zbMATH Keywords

optimization; cyclic scheduling; computational analysis

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90B35: Deterministic scheduling theory in operations research

Related Items

A cyclic scheduling problem with an undetermined number of parallel identical processors, Deadline constrained cyclic scheduling on pipelined dedicated processors considering multiprocessor tasks and changeover times, On scheduling cycle shops: Classification, complexity and approximation, Balancing perfectly periodic service schedules: An application from recycling and waste management

Cites Work

• Unnamed Item
• The complexity of scheduling jobs in repetitive manufacturing systems
• Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
• A study of the cyclic scheduling problem on parallel processors
• Optimal scheduling for two-processor systems
• Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
• Scheduling Sequential Loops on Parallel Processors
• Un domaine très ouvert : les problèmes d'ordonnancement
• Cyclic Schedules for Job Shops with Identical Jobs
• An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays