Minimizing the expected number of tardy jobs when processing times are normally distributed

DOI10.1016/S0167-6377(02)00110-4zbMath1030.90043OpenAlexW2043268737MaRDI QIDQ1612011

Cerry M. Klein, Wooseung Jang

Publication date: 28 August 2002

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(02)00110-4

zbMATH Keywords

stochastic schedulingheuristicsingle machine schedulingdynamic policytardy jobsmyopic approach

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36)

Related Items (10)

Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ Single-machine scheduling with general costs under compound-type distributions ⋮ Minimizing makespan for scheduling stochastic job shop with random breakdown ⋮ A stochastic approach for the single-machine scheduling problem to minimize total expected cost with client-dependent tardiness costs ⋮ MULTIPLE SERVER PREEMPTIVE SCHEDULING WITH IMPATIENCE ⋮ SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS ⋮ Distributionally robust single machine scheduling with risk aversion ⋮ Analysis of computer job control under uncertainty ⋮ Target-based distributionally robust optimization for single machine scheduling

Cites Work

• Unnamed Item
• 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
• On the minimization of the weighted number of tardy jobs with random processing times and deadline
• The stochastic single machine scheduling problem with earliness and tardiness costs
• Bounds on optimal values in stochastic scheduling
• Rearrangement, Majorization and Stochastic Scheduling
• Minimizing Total Tardiness on One Machine is NP-Hard
• Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem
• Stochastic Scheduling with Release Dates and Due Dates
• Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain

This page was built for publication: Minimizing the expected number of tardy jobs when processing times are normally distributed