Stochastic Scheduling with Release Dates and Due Dates
From MaRDI portal
Publication:3674384
DOI10.1287/opre.31.3.559zbMath0523.90046OpenAlexW2128017228MaRDI QIDQ3674384
Publication date: 1983
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.31.3.559
stochastic schedulingrandom processing timesoptimal policiesrandom release datesexpected weighted number of late jobsexpected weighted sum of completion times
Related Items (50)
The stochastic single machine scheduling problem with earliness and tardiness costs ⋮ Two approaches to optimal routing and admission control in systems with real-time traffic ⋮ Minimizing the expected weighted number of tardy jobs in stochastic flow shops ⋮ Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms ⋮ Scheduling with compressible and stochastic release dates ⋮ Setting optimal due dates in a basic safe-scheduling model ⋮ 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 ⋮ Stochastic scheduling on a single machine subject to multiple breakdowns according to different probabilities ⋮ 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 ⋮ On queues with impatience: stability, and the optimality of earliest deadline first ⋮ Dynamic fleet scheduling with uncertain demand and customer flexibility ⋮ Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks ⋮ MULTIPLE SERVER PREEMPTIVE SCHEDULING WITH IMPATIENCE ⋮ Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times ⋮ Job-shop resource scheduling via simulating random operations ⋮ The single-server scheduling problem with convex costs ⋮ Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines ⋮ Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness ⋮ On the relation between complexity and uncertainty ⋮ Multi-stage ordinal optimization based approach for job shop scheduling problems ⋮ 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 ⋮ On the optimality of static policy in stochastic open shop ⋮ Random trees in queueing systems with deadlines ⋮ Workforce planning at USPS mail processing and distribution centers using stochastic optimization ⋮ Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times ⋮ Distributionally robust scheduling on parallel machines under moment uncertainty ⋮ Predictive-reactive scheduling on a single resource with uncertain future jobs ⋮ Stochastic scheduling on parallel machines to minimize discounted holding costs ⋮ Stochastic single machine scheduling with an exponentially distributed due date ⋮ Single-machine scheduling with exponential processing times and general stochastic cost functions ⋮ Dynamic scheduling in manufacturing systems using Brownian approximations ⋮ Minimizing the Expected Weighted Number of Tardy Jobs in the Stochastic Two-Machine Flow Shop ⋮ Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times ⋮ Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times ⋮ Scheduling stochastic jobs with due dates on parallel machines ⋮ Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties ⋮ Scheduling Jobs That Are Subject to Deterministic Due Dates and Have Deteriorating Expected Rewards ⋮ Stochastic programming approaches to stochastic scheduling ⋮ A Tight 2-Approximation for Preemptive Stochastic Scheduling ⋮ A note on the flow time and the number of tardy jobs in stochastic open shops ⋮ Dynamic node packing ⋮ Job selection and sequencing on a single machine in a random environment ⋮ Dynamic scheduling of stochastic jobs on a single machine ⋮ Effects of service disciplines in \(G/GI/s\) queueing systems ⋮ Minimizing the expected number of tardy jobs when processing times are normally distributed
This page was built for publication: Stochastic Scheduling with Release Dates and Due Dates
