Single machine scheduling with randomly compressible processing times

DOI10.1081/SAP-120004116MaRDI QIDQ3146475zbMATH OpenFDO

Authors

Publication date 11 September 2002

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

Full work available at URL https://doi.org/10.1081/SAP-120004116

zbMATH Keywords

due dateearlinessrandom compressionschedulingtardinessV-shaped sequence

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Single–machine scheduling with random machine breakdowns and randomly compressible processing times
• A single-machine scheduling problem with random processing times
• Scheduling problems with random processing times under expected earliness/tardiness costs
• Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs
• A stochastic single machine scheduling with random processing time

Cited in

(4)

• Scheduling with compressible and stochastic release dates
• A single-machine scheduling problem with random processing times
• Single–machine scheduling with random machine breakdowns and randomly compressible processing times
• Scheduling a single machine with compressible jobs to minimize maximum lateness

This page was built for publication: Single machine scheduling with randomly compressible processing times

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