지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- 대한산업공학회 Industrial Engineering & Management Systems Industrial Engineering & Management Systems 제12권 제1호
- 발행연도
- 2013.3
- 수록면
- 51 - 62 (12page)
이용수
초록· 키워드
오류제보하기
This paper considers a single machine rescheduling problem whose original (efficiency related) objective is minimizing makespan. We assume that disruptions such as order cancelations and newly arrived orders occur after the initial scheduling, and we reschedule this disrupted schedule with the objective of minimizing a disruption related objective while preserving the original objective. The disruption related objective measures the impact of the disruptions as difference of completion times in the remaining (uncanceled) jobs before and after the disruptions. The artificial due dates for the remaining jobs are set to completion times in the original schedule while newly arrived jobs do not have due dates. Then, the objective of the rescheduling is minimizing the maximum earliness without tardiness. In order to preserve the optimality of the original objective, we assume that no-idle time and no tardiness are allowed while rescheduling. We first define this new problem and prove that the general version of the problem is unary NP-complete. Then, we develop three simple but intuitive heuristics. For each of the three heuristics, we find a tight bound on the measure called modified z-approximation ratio. The best theoretical bound is found to be 0.5 ? ε for some ε ＞ 0, and it implies that the solution value of the best heuristic is at most around a half of the worst possible solution value. Finally, we empirically evaluate the heuristics and demonstrate that the two best heuristics perform much better than the other one.
목차
ABSTRACT
1. INTRODUCTION
2. NOTATION
3. PRELIMINARY RESULTS
4. COMPLEXITY RESULTS
5. HEURISTICS
6. EVALUATION MEASURE FOR HEURISTICS
7. WORST CASE BOUND ON MODIFIED Z-APPROXIMATION
8. COMPUTATIONAL STUDY
9. SUMMARY AND FURTHER RESEARCH
REFERENCES
참고문헌 (17)
참고문헌 신청
1. [학술지(정기간행물)] - Azizoglu, M. / 2003 / Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed / Journal of the Operational Research Society 54 (6) : 661 ~ 664
2. [학술지(정기간행물)] - Clausen, J. / 2001 / Disruption management-operations research between planning and execution / OR/MS Today 28 (5) : 40 ~ 43
3. [학술지(정기간행물)] - Graham, R. L. / 1979 / Optimization and approximation in deterministic sequencing and scheduling : a survey / Annals of Discrete Mathematics 5 : 287 ~ 326
4. [단행본] - Garey, M. R. / 1979 / Computers and Intractability: A Guide to the Theory of NP-Completeness / Freeman
5. [학술지(정기간행물)] - Guner, E. / 1998 / One machine scheduling to minimize the maximum earliness with minimum number of tardy jobs / International Journal of Production Economics 55 (2) : 213 ~ 219
2. [학술지(정기간행물)] - Clausen, J. / 2001 / Disruption management-operations research between planning and execution / OR/MS Today 28 (5) : 40 ~ 43
3. [학술지(정기간행물)] - Graham, R. L. / 1979 / Optimization and approximation in deterministic sequencing and scheduling : a survey / Annals of Discrete Mathematics 5 : 287 ~ 326
4. [단행본] - Garey, M. R. / 1979 / Computers and Intractability: A Guide to the Theory of NP-Completeness / Freeman
5. [학술지(정기간행물)] - Guner, E. / 1998 / One machine scheduling to minimize the maximum earliness with minimum number of tardy jobs / International Journal of Production Economics 55 (2) : 213 ~ 219
이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2014-500-003115571