scientific article; zbMATH DE number 17808

MaRDI QIDQ3975150zbMATH OpenFDO

Authors Robert C. Holte, Louis E. Rosier, Igor Tulchinsky, Donald Varvel

Publication date 26 June 1992

zbMATH Keywords

minimum cyclic schedule lengthpreventive maintenancereal-time scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Minimizing Service and Operation Costs of Periodic Scheduling
• Schedulers for larger classes of pinwheel instances
• General perfectly periodic scheduling
• A pinwheel scheduler for three distinct numbers with a tight schedulability bound

Cited in

(12)

• Pinwheel scheduling with two distinct numbers
• A pinwheel scheduler for three distinct numbers with a tight schedulability bound
• Pinwheel scheduling: Achievable densities
• Schedulers for larger classes of pinwheel instances
• Windows scheduling of arbitrary-length jobs on multiple machines
• Bamboo garden trimming problem (perpetual maintenance of machines with different attendance urgency factors)
• Approximation algorithms for replenishment problems with fixed turnover times
• Towards the 5/6-density conjecture of pinwheel scheduling
• A frequency-competitive query strategy for maintaining low collision potential among moving entities
• Station assignment with reallocation
• Generalized pinwheel problem
• TDBS: A time division beacon scheduling mechanism for ZigBee cluster-tree wireless sensor networks

This page was built for publication:

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