Single machine sequencing with random processing times and random due‐dates

DOI10.1002/nav.3800160410zbMath0194.19905OpenAlexW1590133793MaRDI QIDQ5589739

William L. Maxwell, Thomas B. Crabill

Publication date: 1969

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800160410

zbMATH Keywords

operations research

Related Items (8)

The stochastic single machine scheduling problem with earliness and tardiness costs ⋮ Setting optimal due dates in a basic safe-scheduling model ⋮ Optimal sequences in stochastic single machine shops ⋮ General stochastic single-machine scheduling with regular cost functions ⋮ Single Machine Stochastic Scheduling: Minimizing the Number of Tardy Jobs ⋮ Optimal regulation of the service rate for a queue with finite waiting space ⋮ Stochastic Flow-Shop Scheduling with Lateness-Related Performance Measures ⋮ Minimizing earliness and tardiness costs in stochastic scheduling

Cites Work

• Scheduling with Deadlines and Loss Functions
• On Scheduling Tasks with Associated Linear Loss Functions
• Scheduling with Random Service Times

This page was built for publication: Single machine sequencing with random processing times and random due‐dates