최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기산업경영시스템학회지 = Journal of society of korea industrial and systems engineering, v.33 no.4, 2010년, pp.45 - 57
이익선 (동아대학교 경영학과) , 윤상흠 (영남대학교 경영학부) , 하귀룡 (포항공과대학교) , 전재호 (충주대학교 행정정보학과)
This paper considers a 2-stage assembly flowshop scheduling problem where each job is completed by assembling multiple components. The problem has the objective measure of minimizing total completion time. The problem is shown to be NP-complete in the strong sense. Thus, we derive some solution prop...
Baker, K. R.; Introduction to Sequencing and Scheduling, John Wiley and Sons, 1974.
Du, J. and Leung, J. Y. T.; "Minimizing mean flow time in two-machine open shops and flow shops," Journal of Algorithms, 14(1) : 24-44, 1993.
Garey, M. R. and Johnson, D. S.; Computers and Intractability- A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
Hariri, A. M. A. and Potts, C. N.; "A branch and bound algorithm for the two-stage assembly scheduling problem," European Journal of Operational Research, 103 : 547-556, 1997.
Koulamas, C. and Kyparisis, G. J.; "The three-stage assembly flowshop scheduling problem," Computers and Operations Research, 28 : 689-704, 2001.
Kovalyov, M. Y., Potts, C. N., and Strusevich, V. A.; "Batching decisions for assembly production systems," European Journal of Operational Research, 157 : 620-642, 2004.
Lee, C. Y., Cheng, T. C. E., and Lin, B. M. T.; "Minimizing the makespan in the 3-machine assembly -type flowshop scheduling problem," Management Science, 39 : 616-625, 1993.
Lin, B. M. T., Cheng, T. C. E., and Chou, A. S. C.; "Scheduling in an assembly-type production chain with batch transfer," OMEGA : The International Journal of Management Science, 35(2) : 143-151, 2007.
Pinedo, M.; Scheduling Theory, Algorithms, and Systems, Prentice-Hall, New Jersey, 2002.
Potts, C. N., Sevast'janov, S. V., Strusevich, V. A., Wassenhove, L. N. V., and Zwaneveld, C. M.; "The two-stage assembly scheduling problem : Complexity and approximation," Operations Research, 43 : 346-355, 1995.
Sun, X., Morizawa, K., and Nagasawa, H.; "Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling," European Journal of Operational Research, 146 : 498-516, 2003.
Sung, C. S. and Juhn, J.; "Makespan minimization for a 2-stage assembly scheduling subject to component available time constraint," International Journal of Production Economics, 119 : 392-401, 2009.
Taha, A. H.; Operations Research-An Introduction, Prentice Hall, New Jersey, 1997.
Tozkapan, A., Kirca, O., and Chung, C. S.; "A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem," Computers and Operations Research, 30 : 309-320, 2003.
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.