A cyclic scheduling problem with an undetermined number of parallel identical processors

DOI10.1007/s10589-009-9239-4zbMath1209.90154OpenAlexW2028745274MaRDI QIDQ626651

Zdeněk Hanzálek, Přemysl Šucha

Publication date: 18 February 2011

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-009-9239-4

zbMATH Keywords

digital signal processing applicationsmulti-processor scheduling

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Optimizing energy consumption of robotic cells by a branch \& bound algorithm ⋮ The resource-constrained modulo scheduling problem: an experimental study ⋮ Converging to periodic schedules for cyclic scheduling problems with resources and deadlines

Uses Software

• CPLEX
• Torsche

Cites Work

• Unnamed Item
• Tabu search algorithms for cyclic machine scheduling problems
• Deadline constrained cyclic scheduling on pipelined dedicated processors considering multiprocessor tasks and changeover times
• The complexity of a cyclic scheduling problem with identical machines and precedence constraints
• Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
• A study of the cyclic scheduling problem on parallel processors
• E ₁₁ and M theory
• Range-chart-guided iterative data-flow graph scheduling
• OPTIMAL SOFTWARE PIPELINING UNDER RESOURCE CONSTRAINTS
• Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling

This page was built for publication: A cyclic scheduling problem with an undetermined number of parallel identical processors