Single-machine scheduling to stochastically minimize maximum lateness

DOI10.1007/S10951-007-0026-8MaRDI QIDQ835562zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

stochastic orderstochastic schedulingrandom due datesdeterministic or stochastic processing timesmaximum weighted lateness

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

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

Cites work

• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• scientific article; zbMATH DE number 605729 (Why is no real title available?)
• Bivariate characterization of some stochastic order relations
• Comparison methods for stochastic models and risks
• General stochastic single-machine scheduling with regular cost functions
• Minimizing the expected weighted number of tardy jobs in stochastic flow shops
• Optimal issuing policies under stochastic field lives
• Rearrangement, Majorization and Stochastic Scheduling
• Sequencing jobs on a single machine with a common due data and stochastic processing times
• Single-machine scheduling with exponential processing times and general stochastic cost functions

Cited in

(15)

• Minimising a weighted quadratic function of job lateness in the stochastic single machine scheduling problem
• Stochastic scheduling problems with general position-based learning effects and stochastic breakdowns
• Single machine scheduling with stochastically dependent times
• Analysis of computer job control under uncertainty
• Minimizing the maximum of job with weighted lateness in a single machine problem
• Stochastic single machine scheduling problem as a multi-stage dynamic random decision process
• Un ordonnancement dynamique de tâches stochastiques sur un seul processeur
• Scheduling chains on a single machine with non-negative time lags
• Minimizing the number of late jobs in a stochastic setting using a chance constraint
• Single machine rescheduling for new orders with maximum lateness minimization
• OPTIMAL SINGLE-MACHINE SCHEDULING FOR MINIMIZING THE SUM OF EARLINESS AND TARDINESS PENALTIES
• Stochastic scheduling to minimize expected maximum lateness
• Minimizing makespan for scheduling stochastic job shop with random breakdown
• Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties
• Single machine scheduling to minimize the number of late jobs under uncertainty.

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)