최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기한국경영과학회지 = Journal of the Korean Operations Research and Management Science Society, v.30 no.1, 2005년, pp.27 - 41
권익현 (고려대학교 산업시스템정보공학과) , 신현준 (삼성전자) , 엄동환 (육군본부) , 김성식 (고려대학교 산업시스템정보공학과)
This paper considers identical parallel machine scheduling problem. Each job has a processing time. due date. weight and family type. If a different type of job is followed by prior job. a family setup is incurred. A two phased heuristic is presented for minimizing the sum of weighted tardiness. In ...
* AI 자동 식별 결과로 적합하지 않은 문장이 있을 수 있으니, 이용에 유의하시기 바랍니다.
?Azizoglu, M and S. Webster, 'Scheduling Parallel Machines to Minimize Weighted Flowtime with Family Set-up Times,' International Journal of Production Research, VoI.41, No.6 (2003), pp.1199-1215
?Barnes, J.W. and J.W. Brennan, 'An Improved Algorithm for Scheduling Jobs on Identical Machines,' lIE Transactions, Vol.9, No.1(1977), pp.25-31
?Bitran, GR and S.M. Gilbert, 'Sequencing Production on Parallel Machines with Two Magnitudes of Sequence-Dependent Setup Cost,' Journal of Manufacturing and Operations Management, Vol.3(1990), pp.190-200
?Cheng, T.C.E. and C.C.S. Sin, 'A State-of-the-Art Review of Parallel-Machine Scheduling Research,' European Journal of Operational Research. Vol.47, No.3(1990), pp.271-292
?Dogramaci, A, 'Production Scheduling of Independent Jobs on Parallel Identical Processors,' International Journal of Production Research, Vol.22, No.4(1984), pp.535-548
?Elmagraby, S.E. and S. Park, 'Scheduling Jobs on a Number of Identical Machines,' lIE ?Transactions, Vol.6, No. 1(1974) , pp.1-13
?Glover, F., 'Tabu Search - Part I,' ORSA Journal on Computing, Vol.1, No.3(1989), pp. 190-206
?Glover, F., 'Tabu search - Part II,' ORSA Journal on Computing, Vol.2, No.1(1990), pp. 4-32
?Glover, F. and M. Laguna, Tabu Search, Kluwer Academic Publishers, Dordrecht, 1997
?Hariri, AMA and C.N. Potts, 'Heuristics for Scheduling Unrelated Parallel Machines,' Computers & Operations Research, Vol.18, No.3(1991) pp.323-331
?Horowitz, E. and S. Sahni, 'Exact and Approximate Algorithms for Scheduling Nonidentical Processors,' Journal of ACM, Vol.23 (1976), pp.317-327
?Karp, R.M, Reducibility among Combinatorial Problems - Complexity of Computer Computations, Plenum Press, New York, 1972
?Laguna, M., J. W. Barnes and F. Glover, 'Tabu Search Methods for Single Machine Scheduling Problem,' Journal of Intelligent Manufacturing, Vol.2, No.1(1991) , pp.63-74
?Lawler, E.L., J.K Lenstra, AHG. Rinnooy Kan and DB. Shmoys, Sequencing and Scheduling : Algorithms and Complexity, Handbooks in Operations and Management Science, Vol.4, 1993
?Lee, Y.H. and M Pinedo, 'Scheduling Jobs on Parallel Machines with Sequence-Dependent Setup Times,' European Journal of Operational Research, Vol.100, No.3(1997), pp.464-474
?Monma, C.L. and C.N. Potts, 'Analysis of Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times,' Operations Research, Vol.41, No.5(1993), pp.981-993
?Ovacik, I.M and R. Uzsoy, 'Rolling Horizon Procedures for Dynamic Parallel Machine Scheduling with Sequence-Dependent Setup Times,' International Journal of Production Research, Vol.33, No.1(1995), pp.3173-3192
?Ovacik, I.M. and R. Uzsoy, Decem- position Methods for Complex Factory Scheduling Problems, Kluwer Academic Publishers, 1997
?Pinedo, M., Scheduling : Theory, Algorithms, and System, Prentice Hall, New Jersey, 1995
?Schutten, J.M.J. and R.A.M. Leussink, 'Parallel Machine Scheduling with Release Dates, Due Dates and Family Setup Times,' Inter?national Journal of Production Economics, Vol.46/47(1996), pp.119-125
?Tang, C.S., 'Scheduling Batches on Parallel Machines with Major and Minor Set-ups,' European Journal of Operational Research, Vol.46, No.1(1990), pp.28-37
?Vasilescu, E.N. and AD. Amar, 'An Empirical Evaluation of the Entrapment Procedure for Scheduling Jobs on Identical Machines,' lIE Transactions, Vol.15(1983), pp.261-263
?Vollmann, T.E, .L.B. Berry, D.C. Whybark and F.R. Jacobs, Manufacturing Planning and Control for Supply Chain Management, McGraw-Hill, 2004
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.