Single-machine scheduling with exponential processing times and general stochastic cost functions
From MaRDI portal
Recommendations
- General stochastic single-machine scheduling with regular cost functions
- scientific article; zbMATH DE number 519846
- Single-machine stochastic scheduling with dependent processing times
- Stochastic single machine scheduling with an exponentially distributed due date
- A stochastic single machine scheduling with random processing time
- Single-machine scheduling with general costs under compound-type distributions
- Single machine scheduling problems with exponentially start time dependent job processing times
- Single machine scheduling with stochastically dependent times
Cites work
- A Renewal Decision Problem
- Minimizing the expected weighted number of tardy jobs in stochastic flow shops
- 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
- Sequencing jobs on a single machine with a common due data and stochastic processing times
- Stochastic Scheduling with Release Dates and Due Dates
Cited in
(12)- Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem
- Single-machine scheduling to stochastically minimize maximum lateness
- Single-machine scheduling with general costs under compound-type distributions
- scientific article; zbMATH DE number 519846 (Why is no real title available?)
- Stochastic bicriteria single machine scheduling with quadratic cost functions
- A stochastic approach for the single-machine scheduling problem to minimize total expected cost with client-dependent tardiness costs
- Stochastic scheduling to minimize expected maximum lateness
- The effect of service time variability on maximum queue lengths in MX/G/1 queues
- Stochastic scheduling on parallel machines to minimize discounted holding costs
- Stochastic single machine scheduling with an exponentially distributed due date
- Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine
- A Bayesian Sequential Single Machine Scheduling Problem to Minimize the Expected Weighted Sum of Flowtimes of Jobs with Exponential Processing Times
This page was built for publication: Single-machine scheduling with exponential processing times and general stochastic cost functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781971)