Scheduling Jobs with Exponential Processing and Arrival Times on Identical Processors so as to Minimize the Expected Makespan

DOI10.1287/moor.6.2.305zbMath0496.90045OpenAlexW2061339814MaRDI QIDQ3960457

Ludo van der Heyden

Publication date: 1981

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

Full work available at URL: https://doi.org/10.1287/moor.6.2.305

zbMATH Keywords

optimal policyidentical processorsscheduling of jobsminimization of expected makespanexponential processing timesexponential arriving timesM/G/p queuing system

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (5)

Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival ⋮ On stochastic optimality of policies in first passage problems ⋮ Distributionally robust scheduling on parallel machines under moment uncertainty ⋮ Scheduling tasks with exponential duration on unrelated parallel machines ⋮ Robust allocation of operating rooms: a cutting plane approach to handle lognormal case durations

This page was built for publication: Scheduling Jobs with Exponential Processing and Arrival Times on Identical Processors so as to Minimize the Expected Makespan