Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties

DOI10.1002/(SICI)1520-6750(199612)43:8%3C1127::AID-NAV5%3E3.0.CO;2-GzbMATH Open0871.90043OpenAlexW1976534804MaRDI QIDQ5690159FDOQ5690159

Authors: Xiaoqiang Cai, Fengsheng Tu 

Publication date: 15 January 1997

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199612)43:8%3C1127::aid-nav5%3E3.0.co;2-g

Recommendations

• Scheduling jobs on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties
• Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties
• The single-machine absolute-deviation early-tardy problem with random completion times
• Stochastic scheduling on parallel machines subject to random breakdowns to minimize expected costs for earliness and tardy jobs
• Stochastic scheduling on a single machine subject to multiple breakdowns according to different probabilities

zbMATH Keywords

schedulingsingle machinecommon due datestochastic breakdownspseudopolynomial time complexity

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Stochastic systems in control theory (general) (93E03)

Cited In (11)

• Scheduling jobs on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties
• Asymmetric earliness and tardiness scheduling with exponential processing times on an unreliable machine
• Single machine scheduling with stochastic processing times or stochastic due-date to minimize the number of early and tardy jobs
• Stochastic single machine scheduling subject to machines breakdowns with quadratic early-tardy penalties for the preemptive-repeat model
• Due-window assignment scheduling problem with stochastic processing times
• Job sequencing and due date assignment in a single machine shop with uncertain processing times
• STOCHASTIC SCHEDULING WITH ASYMMETRIC EARLINESS AND TARDINESS PENALTIES UNDER RANDOM MACHINE BREAKDOWNS
• Stochastic scheduling on parallel machines subject to random breakdowns to minimize expected costs for earliness and tardy jobs
• Single machine stochastic JIT scheduling problem subject to machine breakdowns
• Scheduling problems with random processing times under expected earliness/tardiness costs
• Single–machine scheduling with random machine breakdowns and randomly compressible processing times

This page was built for publication: Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5690159)