충분히 이른 작업의 수를 최대화시키는 확률적 스케줄링 문제

키워드

참고문헌 (11)

1. Balut, S. J., "Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain", Management Science, 19, pp.1283~1288 (1973)
2. Chang, C. -S., "Stochastic Convexity and Stochastic Majorization" (1994), Stochastic Modeling and Analysis of Manufacturing Systems, Springer-Verlag
3. 최재영, "A Review on Scheduling Problems for Minimizing the Number of Late Jobs", 한국생산관리학회지, 22(2), pp.159~175 (2011), 한국생산관리학회
4. Scheduling a Production Line to Minimize Maximum Tardiness, "Jackson, J. R.", UCLA, ~, pp.Research Report, 43 (1955)
5. Katoh, N., "A Polynomial Time Algorithm for A Chance-Constrained Single Machine Scheduling Problem", Operations Research Letters, 2, pp.62~65 (1983)
6. Kise, H., "On Balut’s Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem", Management Science, 29, pp.384~388 (1983)
7. Kise, H., "An Efficient Algorithm for a Chance-Constrained Scheduling Problem", J. Operations Res. Soc, 25, pp.193~203 (1982)
8. Moore, M. J., "An N Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs", Management Science, 15, pp.102~109 (1968)
9. Nemhauser, G. L., "A Note on the Generalized Lagrange Multiplier Solution to an Integer Programming Problem", Operations Research, 16, pp.450~453 (1968)
10. Ross, S. M., "Stochastic Processes" (1996), John Wiley & Sons
11. Sterna, M., "Late work scheduling in shop systems" (2006), Publishing House of Poznan University of Technology

관련 논문AI추천