Single machine stochastic JIT scheduling problem subject to machine breakdowns

DOI10.1007/s11425-007-0151-zzbMath1157.90432OpenAlexW1595297891MaRDI QIDQ931488

Cong-Dian Cheng, Chuan-Li Zhao, Heng-Yong Tang

Publication date: 25 June 2008

Published in: Science in China. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-007-0151-z

zbMATH Keywords

machine breakdownspreemptive-resumepreemptive-repeatstochastic JIT schedulingsum of squared deviations of the expected completion times from the due date

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Risk measure of job shop scheduling with random machine breakdowns ⋮ Scheduling jobs on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties ⋮ Bi-objective single machine scheduling problem with stochastic processing times

Cites Work

• General stochastic single-machine scheduling with regular cost functions
• Stochastic Scheduling on Parallel Machines Subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs
• Stochastic scheduling subject to machine breakdowns: The preemptive-repeat model with discounted reward and other criteria
• Scheduling stochastic jobs on a single machine subject to breakdowns
• Sequencing with Earliness and Tardiness Penalties: A Review
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• Minimising Waiting Time Variance in the Single Machine Problem
• Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties
• STOCHASTIC SCHEDULING WITH PREEMPTIVE-REPEAT MACHINE BREAKDOWNS TO MINIMIZE THE EXPECTED WEIGHTED FLOW TIME
• Single-machine scheduling subject to stochastic breakdowns
• Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties