Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors
From MaRDI portal
expectation of priority policiesidentical parallel processorslongest expected processing timeshortest expected processing timestochastically independent, exponentially distributed servicestochastically independent, exponentially distributed service timessufficient conditions for optimalitytimesweighted flow time
Recommendations
- On the optimality of static priority policies in stochastic scheduling on parallel machines
- scientific article; zbMATH DE number 4064442
- Scheduling jobs on heterogeneous processors
- Scheduling jobs with exponential processing times on parallel machines
- Scheduling Jobs with Exponentially Distributed Processing Times on Two Machines with Resource Constraints
Cited in
(42)- The processor minimization problem with independent waiting-time constraints
- A note on Lehtonen's schedule on parallel processors
- Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines
- Single-machine scheduling with exponential processing times and general stochastic cost functions
- Optimal combinations of priority scheduling rules
- Optimal sequences in stochastic single machine shops
- Scheduling in multi-scenario environment with an agreeable condition on job processing times
- On the optimality of the earliest due date rule in stochastic scheduling and in queueing
- Parameterized multi-scenario single-machine scheduling problems
- Stochastic scheduling on parallel machines to minimize discounted holding costs
- The ``least flexible job first rule in scheduling and in queueing
- A scheduling problem for several parallel servers
- Common due-date assignment and scheduling on single machine with exponential processing times.
- Service network design for freight transportation: a review
- Scheduling Jobs with Exponentially Distributed Processing Times on Two Machines with Resource Constraints
- Scheduling Jobs with Exponentially Distributed Processing Times and Intree Precedence Constraints on Two Parallel Machines
- On the optimality of static priority policies in stochastic scheduling on parallel machines
- Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
- Exponentially distributed jobshop scheduling problems.
- Scheduling jobs with exponential processing times on parallel machines
- Scheduling two classes of exponential jobs on parallel processors: structural results and worst-case analysis
- Socially and Individually Optimal Routing of Stochastic Jobs in Parallel Processor Systems
- Optimal Scheduling of Exponential Tasks with In-Tree Precedence Constraints on Two Parallel Processors Subject to Failure and Repair
- On the optimality of LEPT and cµ rules for machines in parallel
- On a job resequencing issue in parallel processor stochastic scheduling
- Optimal Stochastic Allocation of Machines under Waiting-Time Constraints
- Product grouping for batch processes
- On the optimality of LEPT and μc rules for parallel processors and dependent arrival processes
- Extremal scheduling of parallel processing with and without real-time constraints
- The optimality of LEPT in parallel machine scheduling
- A tight 2-approximation for preemptive stochastic scheduling
- Optimal Scheduling on Parallel Processors with Precedence Constraints and General Costs
- A state-of-the-art survey on multi-scenario scheduling
- A case for on-machine load balancing
- Fifty years of research in scheduling -- theory and applications
- Avoiding local optima in the p-hub location problem using tabu search and GRASP
- A metaheuristic for stochastic service network design
- Scheduling tasks with exponential duration on unrelated parallel machines
- The maximization of CP utilization in an exponential CP-terminal system with different think times and different job sizes
- Single-machine scheduling with general costs under compound-type distributions
- A survey of dynamic network flows
- Preemptive stochastic online scheduling on two uniform machines
This page was built for publication: Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3827790)
