Supporting dispatchability in schedules with consumable resources

DOI10.1007/S10951-005-5313-7MaRDI QIDQ880490zbMATH OpenOpenAlexFDO

Authors Richard J. Wallace, Eugene C. Freuder

Publication date 15 May 2007

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10951-005-5313-7

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Dynamic controllability and dispatchability relationships
• Incremental computation of resource-envelopes in producer-consumer models
• Scheduling activities with time-dependent durations and resource consumptions
• Time-optimal resource allocation under stepwise consumption constraints
• scientific article; zbMATH DE number 4095196

Cites work

• Remote Agent: to boldly go where no AI system has gone before
• Temporal constraint networks

Cited in

(3)

• Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
• Incremental computation of resource-envelopes in producer-consumer models
• Constraint solving in uncertain and dynamic environments: A survey

This page was built for publication: Supporting dispatchability in schedules with consumable resources

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