Pages that link to "Item:Q3674384"

The following pages link to Stochastic Scheduling with Release Dates and Due Dates (Q3674384):

Displaying 50 items.

• Scheduling with compressible and stochastic release dates (Q336364) (← links)
• Setting optimal due dates in a basic safe-scheduling model (Q336772) (← links)
• A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
• On queues with impatience: stability, and the optimality of earliest deadline first (Q386347) (← links)
• Dynamic fleet scheduling with uncertain demand and customer flexibility (Q395693) (← links)
• Random trees in queueing systems with deadlines (Q672995) (← links)
• Scheduling stochastic jobs with due dates on parallel machines (Q750283) (← links)
• A note on the flow time and the number of tardy jobs in stochastic open shops (Q796445) (← links)
• Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem (Q872264) (← links)
• Single-machine scheduling with general costs under compound-type distributions (Q880581) (← links)
• Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines (Q917426) (← links)
• On the relation between complexity and uncertainty (Q920029) (← links)
• Minimizing the expected weighted number of tardy jobs in stochastic flow shops (Q1096531) (← links)
• Sequencing jobs on a single machine with a common due data and stochastic processing times (Q1179194) (← links)
• On the minimization of the weighted number of tardy jobs with random processing times and deadline (Q1186923) (← links)
• On the optimality of static policy in stochastic open shop (Q1186946) (← links)
• Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties (Q1278719) (← links)
• Job selection and sequencing on a single machine in a random environment (Q1310027) (← links)
• Effects of service disciplines in \(G/GI/s\) queueing systems (Q1315354) (← links)
• The stochastic single machine scheduling problem with earliness and tardiness costs (Q1333461) (← links)
• General stochastic single-machine scheduling with regular cost functions (Q1381780) (← links)
• Job-shop resource scheduling via simulating random operations (Q1404663) (← links)
• Dynamic scheduling of stochastic jobs on a single machine (Q1600933) (← links)
• Minimizing the expected number of tardy jobs when processing times are normally distributed (Q1612011) (← links)
• Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness (Q1715728) (← links)
• Single-machine scheduling with exponential processing times and general stochastic cost functions (Q1781971) (← links)
• Two approaches to optimal routing and admission control in systems with real-time traffic (Q1893310) (← links)
• Stochastic scheduling on a single machine subject to multiple breakdowns according to different probabilities (Q1919170) (← links)
• Optimal sequences in stochastic single machine shops (Q1919778) (← links)
• The single-server scheduling problem with convex costs (Q1945446) (← links)
• Distributionally robust scheduling on parallel machines under moment uncertainty (Q1991203) (← links)
• Dynamic node packing (Q2097666) (← links)
• Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times (Q2244222) (← links)
• Stochastic scheduling on parallel machines to minimize discounted holding costs (Q2268513) (← links)
• Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times (Q2288971) (← links)
• Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times (Q2290196) (← links)
• Chance-constrained model for uncertain job shop scheduling problem (Q2403327) (← links)
• Multi-stage ordinal optimization based approach for job shop scheduling problems (Q2449225) (← links)
• Workforce planning at USPS mail processing and distribution centers using stochastic optimization (Q2468733) (← links)
• Predictive-reactive scheduling on a single resource with uncertain future jobs (Q2482799) (← links)
• Stochastic programming approaches to stochastic scheduling (Q2564886) (← links)
• Minimizing the Expected Weighted Number of Tardy Jobs in the Stochastic Two-Machine Flow Shop (Q4695014) (← links)
• Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms (Q5060784) (← links)
• A Tight 2-Approximation for Preemptive Stochastic Scheduling (Q5247621) (← links)
• MULTIPLE SERVER PREEMPTIVE SCHEDULING WITH IMPATIENCE (Q5358113) (← links)
• Scheduling Jobs That Are Subject to Deterministic Due Dates and Have Deteriorating Expected Rewards (Q5488536) (← links)
• Stochastic single machine scheduling with an exponentially distributed due date (Q5945390) (← links)
• Dynamic scheduling in manufacturing systems using Brownian approximations (Q5955769) (← links)
• Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks (Q6109311) (← links)
• Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times (Q6157771) (← links)