Single–machine scheduling with random machine breakdowns and randomly compressible processing times

DOI10.1080/07362990008809689zbMath0973.90035OpenAlexW2040003783WikidataQ126240484 ScholiaQ126240484MaRDI QIDQ4495504

No author found.

Publication date: 10 August 2000

Published in: Stochastic Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/07362990008809689

zbMATH Keywords

schedulingunreliable machinerandom compression

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Optimal unrestricted dynamic stochastic scheduling with partial losses of work due to breakdowns ⋮ Job sequencing and due date assignment in a single machine shop with uncertain processing times ⋮ Risk measure of job shop scheduling with random machine breakdowns ⋮ A stochastic approach for the single-machine scheduling problem to minimize total expected cost with client-dependent tardiness costs ⋮ Optimal rules for single machine scheduling with stochastic breakdowns ⋮ Scheduling jobs on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties ⋮ Scheduling deteriorating jobs on a single machine subject to breakdowns

Cites Work

• A survey of results for sequencing problems with controllable processing times
• A two-machine flow shop scheduling problem with controllable job processing times
• A bicriterion approach to time/cost trade-offs in sequencing
• Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
• Single-machine sequencing with controllable processing times
• Two parallel machine sequencing problems involving controllable job processing times
• Bounds on optimal values in stochastic scheduling
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
• Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties
• Introduction to Stochastic Programming
• Scheduling to minimize the total compression and late costs
• 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