On the minimization of the weighted number of tardy jobs with random processing times and deadline

DOI10.1016/0305-0548(91)90022-JzbMath0744.90040OpenAlexW2027573927MaRDI QIDQ1186923

Prabuddha De, Charles E. Wells, Jay B. Ghosh

Publication date: 28 June 1992

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(91)90022-j

zbMATH Keywords

single machinestochastic schedulingrandom processing timescommon deadlinetotal weighted number of jobs

Mathematics Subject Classification ID

Stochastic programming (90C15) Deterministic scheduling theory in operations research (90B35) Stochastic systems in control theory (general) (93E03)

Related Items (12)

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 ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness ⋮ Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment ⋮ Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times ⋮ Scheduling Jobs That Are Subject to Deterministic Due Dates and Have Deteriorating Expected Rewards ⋮ A production rescheduling expert simulation system ⋮ Job selection and sequencing on a single machine in a random environment ⋮ Dynamic scheduling of stochastic jobs on a single machine ⋮ Minimizing the expected number of tardy jobs when processing times are normally distributed

Cites Work

• Unnamed Item
• Unnamed Item
• Minimizing the expected weighted number of tardy jobs in stochastic flow shops
• Sequencing jobs on a single machine with a common due data and stochastic processing times
• Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem
• Stochastic Scheduling with Release Dates and Due Dates
• N-Job, One Machine Sequencing Problems Under Uncertainty
• A Renewal Decision Problem
• Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain

This page was built for publication: On the minimization of the weighted number of tardy jobs with random processing times and deadline