개인구독
소속 기관이 없으신 경우, 개인 정기구독을 하시면 저렴하게
논문을 무제한 열람 이용할 수 있어요.
지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 발행연도
- 2011.1
- 수록면
- 159 - 175 (17page)
이용수
초록· 키워드
오류제보하기
In this paper, scheduling problems for minimizing the number of late jobs are examined. First, possible real world applications are listed to motivate the interests in these problems. Next, a problem classification scheme is provided. Then, a brief review of the problems, both deterministic and stochastic, that have been effectively solved, is presented. When stochastic scheduling problems are dealt with, they can be further classified in terms of the probabilistic distributions of due dates. After the review, we point out that there still remain some research problems whose solutions would have a beneficial impact on the practice. These would include analytical complexity, alternative performance measures, and parallel machines.
목차
등록된 정보가 없습니다.
참고문헌 (20)
참고문헌 신청
Balut, S. J. / 1973 / Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain / Management Science 19 : 1283 ~ 1288
Blau, R. A. / 1973 / N-Job,One Machine Sequencing Problems under Uncertainty / Management Science 20 : 101 ~ 109
Blazewic, J. / 1984 / Scheduling preemptible tasks on parallel processors with information loss / Technique et Science Informatiques 3 : 415 ~ 420
Blazewicz, J. / 2004 / Open shop scheduling problems with late work criteria / Discrete Applied Mathematics 134 : 1 ~ 24
Boxma, O. J. / 1986 / Minimizing the Expected Weighted Number of Tardy Jobs in Stochastic Flow Shops / Operations Research Letters 5 : 119 ~ 126
Blau, R. A. / 1973 / N-Job,One Machine Sequencing Problems under Uncertainty / Management Science 20 : 101 ~ 109
Blazewic, J. / 1984 / Scheduling preemptible tasks on parallel processors with information loss / Technique et Science Informatiques 3 : 415 ~ 420
Blazewicz, J. / 2004 / Open shop scheduling problems with late work criteria / Discrete Applied Mathematics 134 : 1 ~ 24
Boxma, O. J. / 1986 / Minimizing the Expected Weighted Number of Tardy Jobs in Stochastic Flow Shops / Operations Research Letters 5 : 119 ~ 126
이 논문의 저자 정보
최근 본 자료
댓글(0)
0