Pages that link to "Item:Q5597352"

The following pages link to Scheduling with Random Service Times (Q5597352):

Displaying 30 items.

• Scheduling with compressible and stochastic release dates (Q336364) (← links)
• Setting optimal due dates in a basic safe-scheduling model (Q336772) (← links)
• A genetic algorithm for task scheduling on NoC using FDH cross efficiency (Q474534) (← links)
• Single machine scheduling under market uncertainty (Q856210) (← links)
• A 2-OPT procedure to reduce total inspection time in a serial inspection process (Q877228) (← links)
• Single-machine scheduling with general costs under compound-type distributions (Q880581) (← links)
• Approximation results in parallel machines stochastic scheduling (Q922283) (← links)
• Dynamic priority allocation via restless bandit marginal productivity indices (Q926578) (← links)
• Allocation and scheduling of conditional task graphs (Q969530) (← links)
• Preemptive stochastic online scheduling on two uniform machines (Q976122) (← links)
• General stochastic single-machine scheduling with regular cost functions (Q1381780) (← links)
• When greediness fails: examples from stochastic scheduling. (Q1412702) (← links)
• Minimizing total expected costs in the two-machine, stochastic flow shop (Q1837103) (← links)
• The archievable region method in the optimal control of queueing systems; formulations, bounds and policies (Q1923638) (← links)
• Analysis of computer job control under uncertainty (Q2263387) (← links)
• On index policies for stochastic minsum scheduling (Q2294301) (← links)
• Stochastic machine scheduling to minimize waiting time related objectives with emergency jobs (Q2321516) (← links)
• Minimizing earliness and tardiness costs in stochastic scheduling (Q2356252) (← links)
• Analysis of Smith's rule in stochastic machine scheduling (Q2450731) (← links)
• Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines (Q2664447) (← links)
• Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Types (Q2957467) (← links)
• Unrelated Machine Scheduling with Stochastic Processing Times (Q3186530) (← links)
• Stochastically Minimizing Total Penalty Costs in the Two-Machine Flow Shop with Random Processing Times (Q3200873) (← links)
• (Q3304142) (← links)
• Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling (Q5119844) (← links)
• Approximations to Stochastic Dynamic Programs via Information Relaxation Duality (Q5126622) (← links)
• Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality (Q5131543) (← links)
• A Tight 2-Approximation for Preemptive Stochastic Scheduling (Q5247621) (← links)
• Stochastic Online Scheduling Revisited (Q5505682) (← links)
• Single machine sequencing with random processing times and random due‐dates (Q5589739) (← links)