Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors

DOI10.1287/opre.37.1.126zbMath0673.90058OpenAlexW2120583208MaRDI QIDQ3827790

Thomas Kämpke

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1287/opre.37.1.126

zbMATH Keywords

weighted flow timesufficient conditions for optimalitytimesidentical parallel processorsexpectation of priority policieslongest expected processing timeshortest expected processing timestochastically independent, exponentially distributed servicestochastically independent, exponentially distributed service times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (17)

Optimal sequences in stochastic single machine shops ⋮ Single-machine scheduling with general costs under compound-type distributions ⋮ A state-of-the-art survey on multi-scenario scheduling ⋮ Parameterized multi-scenario single-machine scheduling problems ⋮ A case for on-machine load balancing ⋮ A survey of dynamic network flows ⋮ A scheduling problem for several parallel servers ⋮ Common due-date assignment and scheduling on single machine with exponential processing times. ⋮ Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP ⋮ Service network design for freight transportation: a review ⋮ Preemptive stochastic online scheduling on two uniform machines ⋮ A metaheuristic for stochastic service network design ⋮ Stochastic scheduling on parallel machines to minimize discounted holding costs ⋮ Single-machine scheduling with exponential processing times and general stochastic cost functions ⋮ Scheduling in multi-scenario environment with an agreeable condition on job processing times ⋮ A Tight 2-Approximation for Preemptive Stochastic Scheduling ⋮ Product grouping for batch processes

This page was built for publication: Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors