Technical Note—A Solvable Cyclic Scheduling Problem with Serial Precedence Structure

DOI10.1287/opre.28.5.1236zbMath0449.90055OpenAlexW1978109658MaRDI QIDQ3896831

Robert Garfinkel, W. J. Plotnicki

Publication date: 1980

Published in: Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

minimizing total delayserial precedence structuresolvable cyclic scheduling problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

The complexity of scheduling jobs in repetitive manufacturing systems

This page was built for publication: Technical Note—A Solvable Cyclic Scheduling Problem with Serial Precedence Structure