다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기
한국경영과학회지 = Journal of the Korean Operations Research and Management Science Society, v.39 no.3, 2014년, pp.83 - 91
최병천 (충남대학교 경영학부) , 박명주 (경희대학교 산업경영공학과)
AI-Helper
We consider the problem of scheduling identical jobs with sequence-independent setup times on parallel machines. The objective is to minimize total completion times. We present the pseudopolynomial-time algorithm for the case with a fixed number of machines and an efficient approximation algorithm f...
Ahuja, R.A., K. Mehlhorn, and J.B. Orlin, "Faster algorithm for the shortest path problem," Journal of the Association for Computing Machinery, Vol.37(1990), pp.213-223.
Allahverdi, A., J.N.D. Gupta, and T. Aldowaisan, "A review of scheduling research involving setup considerations," Omega, Vol.27(1999), pp.219-239.
Allahverdi, A., C.T. Ng, T.C.E. Cheng, and M.Y. Kovalyov, "A survey of scheduling problems with setup times or costs," European Journal of Operational Research, Vol.187(2008), pp.985-1032.
Baker, K.R. and D. Trietsch, Principles of Scheduling and Sequencing, John Wiley and Sons, Inc, 2009.
Cheng, T.C.E. and Z.L. Chen, "Parallel machine scheduling with batch setup times," Operations Research, Vol.42(1994), pp.1171-1174.
Liu, Z., W. Yu, and T.C.E. Cheng, "Scheduling groups of unit length jobs on two identical parallel machines," Information Processing Letters, Vol.69(1999), pp.275-281.
Webster, S.T., "The complexity of scheduling job families about a common due date," Operations Research Letters, Vol.20(1997), pp. 65-74.
Webster, S.T. and M. Azzioglu, "Dynamic programming algorithms for scheduling parallel machines with family setup times," Computers and Operations Research, Vol.28(2001), pp.127-137.
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
Free Access. 출판사/학술단체 등이 허락한 무료 공개 사이트를 통해 자유로운 이용이 가능한 논문
Copyright KISTI. All Rights Reserved.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.