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

DOI10.1080/07362990008809689MaRDI QIDQ4495504zbMATH OpenOpenAlexWikidataFDO

Authors

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)

Recommendations

• Single machine scheduling with randomly compressible processing times
• Single-machine scheduling subject to stochastic breakdowns
• Scheduling stochastic jobs on a single machine subject to breakdowns
• Stochastic scheduling on a single machine subject to multiple breakdowns according to different probabilities
• A single-machine scheduling problem with random processing times
• Optimal rules for single machine scheduling with stochastic breakdowns
• A stochastic single machine scheduling with random processing time
• Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties

Cites work

• A bicriterion approach to time/cost trade-offs in sequencing
• A survey of results for sequencing problems with controllable processing times
• A two-machine flow shop scheduling problem with 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
• Introduction to Stochastic Programming
• Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
• Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties
• Scheduling to minimize the total compression and late costs
• Single-machine scheduling subject to stochastic breakdowns
• Single-machine sequencing with controllable processing times
• Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties
• Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
• The single-machine absolute-deviation early-tardy problem with random completion times
• Two parallel machine sequencing problems involving controllable job processing times

Cited in

(8)

• Optimal unrestricted dynamic stochastic scheduling with partial losses of work due to breakdowns
• Scheduling jobs on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties
• Optimal rules for single machine scheduling with stochastic breakdowns
• 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
• Scheduling deteriorating jobs on a single machine subject to breakdowns
• Job sequencing and due date assignment in a single machine shop with uncertain processing times
• Single machine scheduling with randomly compressible processing times

This page was built for publication: Single–machine scheduling with random machine breakdowns and randomly compressible processing times

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