Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem

DOI10.1016/j.ejor.2006.05.036zbMath1121.90064OpenAlexW2133204269MaRDI QIDQ872264

Hossein Soroush

Publication date: 27 March 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.05.036

zbMATH Keywords

schedulingsingle machinestochasticearly and tardy jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (17)

Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times ⋮ Distributionally robust single machine scheduling with the total tardiness criterion ⋮ Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates ⋮ Solving a stochastic single machine problem with initial idle time and quadratic objective ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ A stochastic approach for the single-machine scheduling problem to minimize total expected cost with client-dependent tardiness costs ⋮ Single machine scheduling with release dates: a distributionally robust approach ⋮ Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times ⋮ Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness ⋮ Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times ⋮ Distributionally robust single machine scheduling with risk aversion ⋮ Robust scheduling on a single machine to minimize total flow time ⋮ Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time ⋮ A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times ⋮ Stochastic single machine scheduling problem as a multi-stage dynamic random decision process ⋮ Target-based distributionally robust optimization for single machine scheduling ⋮ Bi-objective single machine scheduling problem with stochastic processing times

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithm for minimizing weighted earliness penalty in single-machine problem
• Inference for the crossing point of two continuous cdf's
• 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
• The stochastic single machine scheduling problem with earliness and tardiness costs
• Dynamic scheduling of stochastic jobs on a single machine
• Earliness-tardiness scheduling with setup considerations
• Single-machine scheduling with exponential processing times and general stochastic cost functions
• Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
• Machine scheduling with earliness, tardiness and non-execution penalties
• Single machine scheduling to minimize the number of early and tardy jobs
• Sequencing with Earliness and Tardiness Penalties: A Review
• Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem
• Stochastic Scheduling with Release Dates and Due Dates
• The Single Machine Early/Tardy Problem
• Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties
• The single-machine absolute-deviation early-tardy problem with random completion times
• Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain

This page was built for publication: Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem