A polynomial time algorithm for a chance-constrained single machine scheduling problem
- 30 June 1983
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 2 (2) , 62-65
- https://doi.org/10.1016/0167-6377(83)90038-x
Abstract
No abstract availableFunding Information
- Ministry of Education, Culture, Sports, Science and Technology
This publication has 3 references indexed in Scilit:
- AN EFFICIENT ALGORITHM FOR A CHANCE-CONSTRAINED SCHEDULING PROBLEMJournal of the Operations Research Society of Japan, 1982
- Stochastic spanning tree problemDiscrete Applied Mathematics, 1981
- Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are UncertainManagement Science, 1973