Grouping tasks to save energy in a cyclic scheduling problem: a complexity study

DOI10.1016/J.EJOR.2020.01.005MaRDI QIDQ2178065zbMATH OpenOpenAlexWikidataFDO

Authors Claire Hanen, Zdeněk Hanzálek

Publication date 7 May 2020

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

Full work available at URL https://doi.org/10.1016/j.ejor.2020.01.005

zbMATH Keywords

complexity theoryschedulingcyclic schedulingenergy savingstask grouping

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A study of the cyclic scheduling problem on parallel processors
• The complexity of a cyclic scheduling problem with identical machines and precedence constraints
• scientific article; zbMATH DE number 850294
• Converging to periodic schedules for cyclic scheduling problems with resources and deadlines
• A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule

Cites work

• A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times
• A parallel algorithm for gradient training of feedforward neural networks
• A parametric critical path problem and an application for cyclic scheduling
• Converging to periodic schedules for cyclic scheduling problems with resources and deadlines
• Cyclic multiple-robot scheduling with time-window constraints using a critical path approach
• Cyclic scheduling of a 2-machine robotic cell with tooling constraints
• Introduction to algorithms.
• On a routing problem
• On the existence of dominating 6-cyclic schedules in four-machine robotic cells
• Open shop cyclic scheduling
• Robust optimization for the cyclic hoist scheduling problem
• Scheduling with batching: A review
• Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
• Tabu search algorithms for cyclic machine scheduling problems
• The complexity of a cyclic scheduling problem with identical machines and precedence constraints
• The impact of core precedences in a cyclic RCPSP with precedence delays
• Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays

This page was built for publication: Grouping tasks to save energy in a cyclic scheduling problem: a complexity study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2178065)