Minimizing the expected weighted number of tardy jobs in stochastic flow shops

DOI10.1016/0167-6377(86)90084-2zbMath0633.90028OpenAlexW2045065221MaRDI QIDQ1096531

Onno J. Boxma, Frank G. Forst

Publication date: 1986

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

Full work available at URL: https://ir.cwi.nl/pub/1783

zbMATH Keywords

optimality conditionssingle machineflow shopstochastic schedulingdue datesarbitrary number of machinesexpected weighted number of tardy jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (21)

Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ The stochastic single machine scheduling problem with earliness and tardiness costs ⋮ Single-machine scheduling to stochastically minimize maximum lateness ⋮ Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem ⋮ Chance-constrained model for uncertain job shop scheduling problem ⋮ Optimal sequences in stochastic single machine shops ⋮ General stochastic single-machine scheduling with regular cost functions ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ Single-machine scheduling with general costs under compound-type distributions ⋮ Single Machine Stochastic Scheduling: Minimizing the Number of Tardy Jobs ⋮ SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS ⋮ On the minimization of the weighted number of tardy jobs with random processing times and deadline ⋮ Single-machine scheduling with exponential processing times and general stochastic cost functions ⋮ Minimizing the Expected Weighted Number of Tardy Jobs in the Stochastic Two-Machine Flow Shop ⋮ Scheduling Jobs That Are Subject to Deterministic Due Dates and Have Deteriorating Expected Rewards ⋮ Stochastic Flow-Shop Scheduling with Lateness-Related Performance Measures ⋮ A General Framework for Stochastic One-machine Scheduling Problems with Zero Release Times and No Partial Ordering ⋮ Job selection and sequencing on a single machine in a random environment ⋮ Dynamic scheduling of stochastic jobs on a single machine ⋮ Application of genetic algorithm to stochastic single machine scheduling problem with earliness and tardiness costs ⋮ Minimizing the expected number of tardy jobs when processing times are normally distributed

Cites Work

• Unnamed Item
• Unnamed Item
• A polynomial time algorithm for a chance-constrained single machine scheduling problem
• Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem
• On stochastic scheduling problems with due dates
• Stochastic Scheduling with Release Dates and Due Dates
• AN EFFICIENT ALGORITHM FOR A CHANCE-CONSTRAINED SCHEDULING PROBLEM
• 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 weighted number of tardy jobs in stochastic flow shops