Stochastic scheduling on parallel machines to minimize discounted holding costs
From MaRDI portal
Publication:2268513
DOI10.1007/s10951-009-0103-2zbMath1185.90141MaRDI QIDQ2268513
Xianyi Wu, Xian Zhou, Xiaoqiang Cai
Publication date: 8 March 2010
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-009-0103-2
flowtime; parallel machines; makespan; stochastic scheduling; dynamic policy; discounted holding cost; discounted rewords; LEPT rule; SEPT rule; static list policy
90B36: Stochastic scheduling theory in operations research
90B90: Case-oriented studies in operations research
Related Items
A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity, A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation results in parallel machines stochastic scheduling
- On scheduling tasks with exponential service times and in-tree precedence constraints
- Job scheduling to minimize expected weighted flowtime on uniform processors
- Non-additive measure and integral
- Single-machine scheduling with exponential processing times and general stochastic cost functions
- A scheduling problem for several parallel servers
- On-line algorithms for minimizing makespan on batch processing machines
- The performance of index-based policies for bandit problems with stochastic machine availability
- Stochastic Scheduling on Parallel Machines Subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs
- Necessary optimality conditions for priority policies in stochastic weighted flowtime scheduling problems
- Scheduling tasks with exponential service times on parallel processors
- Stochastic Scheduling with Release Dates and Due Dates
- On the optimality of static priority policies in stochastic scheduling on parallel machines
- Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
- Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors
- Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions
- Multiserver scheduling of jobs with increasing completion rates
- Scheduling jobs by stochastic processing requirements on parallel machines to minimize makespan or flowtime
- Scheduling jobs on non-identical IFR processors to minimize general cost functions
- On the optimality of LEPT and cµ rules for machines in parallel
- On the optimality of LEPT and μc rules for parallel processors and dependent arrival processes
- On Stochastic Scheduling with In-Tree Precedence Constraints
- Bounds for Certain Multiprocessing Anomalies
- Discounted Multiarmed Bandit Problems on a Collection of Machines with Varying Speeds
- Scheduling spares with exponential lifetimes in a two‐component parallel system
- Asymmetric earliness and tardiness scheduling with exponential processing times on an unreliable machine
- The dependence of optimal returns from multi-class queueing systems on their customer base
