Single-machine scheduling with exponential processing times and general stochastic cost functions
From MaRDI portal
Publication:1781971
DOI10.1007/s10898-004-5702-zzbMath1090.90073OpenAlexW2063711711MaRDI QIDQ1781971
Publication date: 9 June 2005
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-004-5702-z
Deterministic scheduling theory in operations research (90B35) Stochastic scheduling theory in operations research (90B36)
Related Items (8)
Single-machine scheduling to stochastically minimize maximum lateness ⋮ Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem ⋮ Single-machine scheduling with general costs under compound-type distributions ⋮ A stochastic approach for the single-machine scheduling problem to minimize total expected cost with client-dependent tardiness costs ⋮ Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine ⋮ Stochastic scheduling to minimize expected maximum lateness ⋮ Stochastic scheduling on parallel machines to minimize discounted holding costs ⋮ The effect of service time variability on maximum queue lengths in MX/G/1 queues
Cites Work
- Minimizing the expected weighted number of tardy jobs in stochastic flow shops
- Sequencing jobs on a single machine with a common due data and stochastic processing times
- Stochastic Scheduling with Release Dates and Due Dates
- 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
- A Renewal Decision Problem
This page was built for publication: Single-machine scheduling with exponential processing times and general stochastic cost functions
