Fixed Cycle Scheduling: A Solvable Problem with Empty Precedence Structure

DOI10.1287/OPRE.38.4.629MaRDI QIDQ3197613zbMATH OpenOpenAlexFDO

Authors Robert Garfinkel, W. J. Plotnicki

Publication date 1990

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.38.4.629

zbMATH Keywords

empty precedence structureFixed Cycle Schedulingjob schedulinguniform job arrivals

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• The basic cyclic scheduling problem with linear precedence constraints
• Cyclic scheduling problems with linear precedences and resource constraints
• The complexity of a cyclic scheduling problem with identical machines and precedence constraints
• Precedence constraint posting for cyclic scheduling problems
• scientific article; zbMATH DE number 4147849
• The cyclical scheduling problem
• The cyclical scheduling problem
• On the complexity of a periodic scheduling problem with precedence relations
• The basic cyclic scheduling problem with deadlines
• A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule

Cited in

(1)

• Determining the optimal starting times in a cyclic schedule with a given route

This page was built for publication: Fixed Cycle Scheduling: A Solvable Problem with Empty Precedence Structure

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