지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- 한국경영과학회 Management Science and Financial Engineering Management Science and Financial Engineering Vol.18 No.2
- 발행연도
- 2012.11
- 수록면
- 5 - 11 (7page)
이용수
초록· 키워드
오류제보하기
In this paper, stochastic scheduling problems are considered when processing times and due dates follow arbitrary distributions and due dates are either common or exchangeable. For maximizing the expected number of early jobs, two policies, one, based on pairwise comparisons of the processing times, and the other, based on survivabilities, are introduced. In addition, it is shown that the former guarantees optimal solutions when the processing times and due dates are deterministic and that the latter guarantees optimal solutions when the due dates follow exponential distributions. Then a new approach, exploiting the two policies, is proposed and analyzed which turns out to give better job sequences in many situations. In fact, the new approach guarantees optimal solutions both when the processing times and due dates are deterministic and when the due dates follow exponential distributions.
목차
ABSTRACT
1. INTRODUCTION
2. ALGORITHMS
3. PROBLEMS
4. FINAL REMARKS
REFERENCES
참고문헌 (10)
참고문헌 신청
Boxma, O. J / 1986 / Minimizing the Expected Weighted Number of Tardy Jobs in Stochastic Flow Shops / Operations Research Letters 5:119~126
Cai, X / 1999 / Stochastic Scheduling on Parallel Machines subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs / Operations Research 47:422~437
최재영 / 2011 / A Review on Scheduling Problems for Minimizing the Number of Late Jobs / 한국생산관리학회지 22(2):159~175
De, P. / 1991 / On the Minimization of the Weighted Number of Tardy Jobs with Random Processing Times and Deadline / Computers and Operations Research 18:457~463
Jang, W. / 2002 / Dynamic Scheduling of Stochastic Jobs on a Single Machine / European Journal of Operational Research 138:518~530
Cai, X / 1999 / Stochastic Scheduling on Parallel Machines subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs / Operations Research 47:422~437
최재영 / 2011 / A Review on Scheduling Problems for Minimizing the Number of Late Jobs / 한국생산관리학회지 22(2):159~175
De, P. / 1991 / On the Minimization of the Weighted Number of Tardy Jobs with Random Processing Times and Deadline / Computers and Operations Research 18:457~463
Jang, W. / 2002 / Dynamic Scheduling of Stochastic Jobs on a Single Machine / European Journal of Operational Research 138:518~530
이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2014-325-000831560