Stochastically Minimizing Total Delay of Jobs Subject to Random Deadlines

DOI10.1017/S0269964800002126MaRDI QIDQ3416017zbMATH OpenFDO

Authors Susan H. Xu

Publication date 19 January 2007

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0269964800002126

Mathematics Subject Classification ID

Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Stochastic scheduling theory in operations research (90B36)

Recommendations

• Minimizing the number of tardy jobs with stochastically-ordered processing times
• Scheduling jobs with stochastic processing times and due dates to minimize total tardiness
• On the minimization of the weighted number of tardy jobs with random processing times and deadline
• Minimizing the number of late jobs in a stochastic setting using a chance constraint
• Stochastic scheduling to minimize expected maximum lateness
• Scheduling stochastic jobs on a single machine to minimize weighted number of tardy jobs
• Minimizing weighted tardiness of jobs with stochastic interruptions in parallel machines
• The Stochastic Sequential Assignment Problem With Random Deadlines

Cites work

• A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors
• scientific article; zbMATH DE number 3906232 (Why is no real title available?)
• Individually optimal routing in parallel systems
• Job scheduling to minimize expected weighted flowtime on uniform processors
• Minimizing expected makespans of multi-priority classes of jobs on uniform processors
• Minimizing expected makespans on uniform processor systems
• Stochastic dispatching of multi-priority jobs to heterogeneous processors
• Stochastically maximizing the number of successes in a sequential assignment problem

Cited in

(6)

• Routing jobs with deadlines to heterogeneous parallel servers
• Socially and Individually Optimal Routing of Stochastic Jobs in Parallel Processor Systems
• Myopic policies for non-preemptive scheduling of jobs with decaying value
• Generalized Exact Scheduling: A Minimal-Variance Distributed Deadline Scheduler
• A case for on-machine load balancing
• Optimal differentiated threshold characterization for multi-task stochastic deadline scheduling with queuing

This page was built for publication: Stochastically Minimizing Total Delay of Jobs Subject to Random Deadlines

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