Single-machine scheduling to stochastically minimize maximum lateness
From MaRDI portal
Publication:835562
DOI10.1007/S10951-007-0026-8zbMATH Open1168.90487OpenAlexW2065803401MaRDI QIDQ835562FDOQ835562
Authors: Xiaoqiang Cai, Liming Wang, Xian Zhou
Publication date: 28 August 2009
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-007-0026-8
Recommendations
- Stochastic scheduling to minimize expected maximum lateness
- Single Machine Stochastic Scheduling: Minimizing the Number of Tardy Jobs
- Stochastic single machine scheduling with an exponentially distributed due date
- On the minimization of the weighted number of tardy jobs with random processing times and deadline
- Stochastic single machine scheduling to minimize the weighted number of tardy jobs
stochastic orderstochastic schedulingrandom due datesdeterministic or stochastic processing timesmaximum weighted lateness
Cites Work
- Title not available (Why is that?)
- Comparison methods for stochastic models and risks
- Title not available (Why is that?)
- Bivariate characterization of some stochastic order relations
- Sequencing jobs on a single machine with a common due data and stochastic processing times
- Minimizing the expected weighted number of tardy jobs in stochastic flow shops
- General stochastic single-machine scheduling with regular cost functions
- Rearrangement, Majorization and Stochastic Scheduling
- Optimal issuing policies under stochastic field lives
- Single-machine scheduling with exponential processing times and general stochastic cost functions
Cited In (15)
- Single machine rescheduling for new orders with maximum lateness minimization
- Stochastic scheduling problems with general position-based learning effects and stochastic breakdowns
- Minimizing the number of late jobs in a stochastic setting using a chance constraint
- Scheduling chains on a single machine with non-negative time lags
- Minimizing makespan for scheduling stochastic job shop with random breakdown
- Analysis of computer job control under uncertainty
- Stochastic scheduling to minimize expected maximum lateness
- Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties
- Single machine scheduling to minimize the number of late jobs under uncertainty.
- Single machine scheduling with stochastically dependent times
- Stochastic single machine scheduling problem as a multi-stage dynamic random decision process
- Un ordonnancement dynamique de tâches stochastiques sur un seul processeur
- Minimising a weighted quadratic function of job lateness in the stochastic single machine scheduling problem
- OPTIMAL SINGLE-MACHINE SCHEDULING FOR MINIMIZING THE SUM OF EARLINESS AND TARDINESS PENALTIES
- Minimizing the maximum of job with weighted lateness in a single machine problem
This page was built for publication: Single-machine scheduling to stochastically minimize maximum lateness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835562)