AN EFFICIENT ALGORITHM FOR A CHANCE-CONSTRAINED SCHEDULING PROBLEM

DOI10.15807/JORSJ.25.193MaRDI QIDQ3944341zbMATH OpenOpenAlexFDO

Authors Akira Shiomi, Minoru Uno, Da-Sheng Chao, 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 algorithmefficient algorithmrandom processing timeschance-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)

Cited in

(3)

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

This page was built for publication: AN EFFICIENT ALGORITHM FOR A CHANCE-CONSTRAINED SCHEDULING PROBLEM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3944341)