지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- 대한산업공학회 Industrial Engineering & Management Systems Industrial Engineering & Management Systems 제10권 제1호
- 발행연도
- 2011.3
- 수록면
- 15 - 23 (9page)
이용수
초록· 키워드
오류제보하기
This research considers scheduling problems with jobs which can be divided into sub-jobs and do not required to be processed immediately following one another. Heuristic algorithms considering how to divide jobs are proposed in an attempt to find near-optimal solutions within reasonable run time. The algorithms contain two phases which are executed recursively. Phase 1 of the algorithm determines how jobs should be divided while phase 2 solves the scheduling problem given the sub-jobs established in phase 1. Simulated annealing and genetic algorithms are applied for the two phases and four heuristic algorithms are established. Numerical experiment is conducted to determine the best parameter values for the heuristic algorithms. Examples with different sizes and levels of complexity are generated. Performance of the proposed algorithms is evaluated. It is shown that the proposed algorithms are able to efficiently and effectively solve the considered problems.
목차
Abstract
1. INTRODUCTION
2. PROBLEM DECRIPTION
3. ALGORITHMS
4. TEST INSTANCES
5. NUMERICAL EXPERIMENT
6. CONCLUSION
REFERENCES
참고문헌 (21)
참고문헌 신청
Anagnostopoulos, G. C. / 2002 / A simulated annealing algorithm for the unrelated parallel machine scheduling problem / Proceedings of the 5th Biannual World Automation Congress :115~120
Armentano, V. A. / 2007 / Minimizing total tardiness in parallel machine scheduling with setup times: An adaptive memory–based GRASP approach / European Journal of Operational Research 183(1):100~114
Azizoglu, M. / 1998 / Tardiness minimization on parallel machines / International Journal of Production Economics 55(2):163~168
Azizoglu, M. / 1999 / On the minimization of total weighted flow time with identical and uniform parallel machines / European Journal of Operational Research 113(1):91~100
Bilge, U. / 2004 / A tabu search algorithm for parallel machine total tardiness problem / Computers and Operations Research 31(3):397~414
Armentano, V. A. / 2007 / Minimizing total tardiness in parallel machine scheduling with setup times: An adaptive memory–based GRASP approach / European Journal of Operational Research 183(1):100~114
Azizoglu, M. / 1998 / Tardiness minimization on parallel machines / International Journal of Production Economics 55(2):163~168
Azizoglu, M. / 1999 / On the minimization of total weighted flow time with identical and uniform parallel machines / European Journal of Operational Research 113(1):91~100
Bilge, U. / 2004 / A tabu search algorithm for parallel machine total tardiness problem / Computers and Operations Research 31(3):397~414
이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2013-530-003635916