Scheduling jobs on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties

DOI10.1007/s11425-007-0193-2zbMath1153.90443OpenAlexW2023058919MaRDI QIDQ943438

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

Publication date: 9 September 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-0193-2

zbMATH Keywords

schedulingdue date\(V\)-shapeabsolute early-tardy penaltystochastic breakdowns

Mathematics Subject Classification ID

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

Cites Work

• Determining the optimal run time for EPQ model with scrap, rework, and stochastic breakdowns
• Single machine stochastic JIT scheduling problem subject to machine breakdowns
• A V-shape property of optimal schedule of jobs about a common due date
• Scheduling problems with non-regular penalty functions - a review
• V-shape property of optimal sequence of jobs about a common due date on a single machine
• Single machine scheduling with coefficient of variation minimization
• V-shape property for optimal schedules with monotone penalty functions
• A dominant subset of \(V\)-shaped sequences for a class of single machine sequencing problems
• General stochastic single-machine scheduling with regular cost functions
• Optimal scheduling of tasks when service is subject to disruption: the preempt-repeat case
• STOCHASTIC SCHEDULING WITH ASYMMETRIC EARLINESS AND TARDINESS PENALTIES UNDER RANDOM MACHINE BREAKDOWNS
• Sequencing with Earliness and Tardiness Penalties: A Review
• Minimizing mean absolute deviation of completion times about a common due date
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• Minimising Waiting Time Variance in the Single Machine Problem
• Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties
• Single Machine Scheduling Problems with General Breakdowns, Earliness and Tardiness Costs
• Single–machine scheduling with random machine breakdowns and randomly compressible processing times
• STOCHASTIC SCHEDULING WITH PREEMPTIVE-REPEAT MACHINE BREAKDOWNS TO MINIMIZE THE EXPECTED WEIGHTED FLOW TIME
• The single-machine absolute-deviation early-tardy problem with random completion times
• 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