1 |
Kise, H. and Ibaraki, T.; "On Balut's Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem," Management Science, 29 : 384-388, 1983.
DOI
ScienceOn
|
2 |
Kise, H., Shiomi, A., Uno, M., and Chao, D.-S.; "An Efficient Algorithm for a Chance-Constrained Scheduling Problem," J. Operations Res. Soc. Japan, 25, 193-203, 1982.
DOI
|
3 |
Moore, M. J.; "An N Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs," Management Science, 15 : 102-109, 1968.
DOI
ScienceOn
|
4 |
Nemhauser, G. L. and Ullmann Z.; "A Note on the Generalized Lagrange Multiplier Solution to an Integer Programming Problem," Operations Research, 16, 450-453, 1968.
DOI
ScienceOn
|
5 |
Ross, S. M.; Stochastic Processes, John Wiley & Sons, second edition, 1996.
|
6 |
Sterna, M.; Late work scheduling in shop systems, Publishing House of Poznan University of Technology, 2006.
|
7 |
Balut, S. J.; "Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain," Management Science, 19 : 1283-1288, 1973.
DOI
ScienceOn
|
8 |
Chang, C.-S., Shanthikumar, J. G., and Yao, D. D.; "Stochastic Convexity and Stochastic Majorization," Stochastic Modeling and Analysis of Manufacturing Systems, Springer-Verlag, New York, 1994.
|
9 |
Choi, J. and Kim, H.; "A Review on Scheduling Problems for Minimizing the Number of Late Jobs," Korean Production and Operations Management Society, 22 : 159-175, 2011.
|
10 |
Jackson, J. R.; "Scheduling a Production Line to Minimize Maximum Tardiness," Research Report, 43 : UCLA, 1955.
|
11 |
Katoh, N. and Ibaraki, T.; "A Polynomial Time Algorithm for A Chance-Constrained Single Machine Scheduling Problem," Operations Research Letters, 2 : 62-65, 1983.
DOI
ScienceOn
|