Optimal Stochastic Allocation of Machines under Waiting-Time Constraints
From MaRDI portal
Publication:4032942
DOI10.1137/0222025zbMath0778.90024OpenAlexW1980844816MaRDI QIDQ4032942
Paul E. Wright, Edward G. jun. Coffman, Leopold Flatto
Publication date: 17 May 1993
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0222025
Bellman equationnonpreemptive schedulingstochastic jobsexpected number of parallel machineshard-deadline problem
Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22) Optimal stochastic control (93E20) Markov and semi-Markov decision processes (90C40) Probabilistic games; gambling (91A60)
Related Items
Two simulated annealing-based heuristics for the job shop scheduling problem ⋮ The processor minimization problem with independent waiting-time constraints