AN EFFICIENT ALGORITHM FOR A CHANCE-CONSTRAINED SCHEDULING PROBLEM

DOI10.15807/jorsj.25.193zbMath0484.90064OpenAlexW2182015432MaRDI QIDQ3944341

Minoru Uno, Da-Sheng Chao, Akira Shiomi, Hiroshi Kise

Publication date: 1982

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.25.193

zbMATH Keywords

NP-completenesspolynomial algorithmrandom processing timesefficient algorithmchance-constrained scheduling problemn-job one machine scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items

Minimizing the expected weighted number of tardy jobs in stochastic flow shops, General stochastic single-machine scheduling with regular cost functions, A polynomial time algorithm for a chance-constrained single machine scheduling problem