Load Scheduling of Simple Temporal Networks Under Dynamic Resource Pricing

In this paper, we use the STN framework to study important classes of load scheduling problems that involve metric Efficient algorithms for temporal reasoning are critical for temporal constraints as well as costs of resources. Problems a large number of real-world applications, including autonomous that can be studied in this framework include those that arise space exploration (Knight et al. 2001), domestic in the smart home (Qayyum et al. 2015) and smart grid domains activity management, and job scheduling on servers (Ji, He, (Sianaki, Hussain, and Tabesh 2010) as well as in high and Cheng 2007). Many formalisms have been proposed performance computing (HPC) (Yang et al. 2013) and job and are currently used for reasoning with metric time and shop scheduling (Xiong, Sadeh, and Sycara 1992). Although resources (Smith and Cheng 1993; Kumar 2003; Muscettola the STN framework can be extended to reason about the resource 2004). Simple Temporal Networks (STNs) (Dechter, Meiri, requirements of events (Kumar 2003), in this paper, and Pearl 1991) are popularly used for efficiently reasoning for simplicity of exposition, we reason about the resource about difference constraints in scheduling problems.