OL-DEC-MDP model for multiagent online scheduling with a time-dependent probability of success

DOI10.1155/2014/753487MaRDI QIDQ1719084zbMATH OpenOpenAlexWikidataFDO

Authors Cheng Zhu, Jiangfeng Luo, Zhong Liu, Wei Ming Zhang

Publication date 8 February 2019

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.1155/2014/753487

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Markov and semi-Markov decision processes (90C40)

Review text

Summary: Focusing on the on-line multiagent scheduling problem, this paper considers the time-dependent probability of success and processing duration and proposes an OL-DEC-MDP (opportunity loss-decentralized Markov Decision Processes) model to include opportunity loss into scheduling decision to improve overall performance. The success probability of job processing as well as the process duration is dependent on the time at which the processing is started. The probability of completing the assigned job by an agent would be higher when the process is started earlier, but the opportunity loss could also be high due to the longer engaging duration. As a result, OL-DEC-MDP model introduces a reward function considering the opportunity loss, which is estimated based on the prediction of the upcoming jobs by a sampling method on the job arrival. Heuristic strategies are introduced in computing the best starting time for an incoming job by each agent, and an incoming job will always be scheduled to the agent with the highest reward among all agents with their best starting policies. The simulation experiments show that the OL-DEC-MDP model will improve the overall scheduling performance compared with models not considering opportunity loss in heavy-loading environment.

Recommendations

• Models and Algorithms for Stochastic Online Scheduling
• Online scheduling on multiple resources under stochastic conditions
• Scalable Online Planning for Multi-Agent MDPs
• Stochastic Online Scheduling Revisited
• Scheduling in multiagent systems using reinforcement learning
• Parallel rollout for online solution of partially observable Markov decision processes
• Approximation in Preemptive Stochastic Online Scheduling
• Coping with Incomplete Information in Scheduling — Stochastic and Online Models
• scientific article; zbMATH DE number 2156732

Cites work

• A heuristic search approach to planning with continuous resources in stochastic domains
• An anytime multistep anticipatory algorithm for online stochastic combinatorial optimization
• Equivalent time-dependent scheduling problems
• scientific article; zbMATH DE number 3128787 (Why is no real title available?)
• Online stochastic optimization under time constraints
• Scheduling algorithms for procrastinators
• Scheduling projects with stochastic activity duration to maximize expected net present value
• Scheduling time-dependent jobs under mixed deterioration
• Scheduling. Theory, algorithms, and systems.
• Stochastic optimization for real time service capacity allocation under random service demand
• Time-dependent scheduling

Cited in

(2)

• Naval air defense planning problem: a novel formulation and heuristics
• Deliberation scheduling using GSMDPs in stochastic asynchronous domains

This page was built for publication: OL-DEC-MDP model for multiagent online scheduling with a time-dependent probability of success

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