The basic cyclic scheduling problem with deadlines

DOI10.1016/0166-218X(91)90037-WzbMath0729.90051MaRDI QIDQ806665

Philippe Chrétienne

Publication date: 1991

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

upper bounddeadlinescyclic schedulinglatest schedulelatest starting timeoptimal cyclic production

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (10)

A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints ⋮ A study of the cyclic scheduling problem on parallel processors ⋮ Converging to periodic schedules for cyclic scheduling problems with resources and deadlines ⋮ The basic cyclic scheduling problem with linear precedence constraints ⋮ Steady state analysis of timed event graphs with time window constraints ⋮ A robust basic cyclic scheduling problem ⋮ Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints ⋮ Minimizing the number of workers in a paced mixed-model assembly line ⋮ A general model for cyclic machine scheduling problems ⋮ List schedules for cyclic scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling periodically occurring tasks on multiple processors
• A characterization of the minimum cycle mean in a digraph
• A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing
• Chemins extrémaux d'un graphe doublement valué
• Performance evaluation of job-shop systems using timed event-graphs
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: The basic cyclic scheduling problem with deadlines