ms·1993년 5월 1일
Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
Chung‐Yee Lee, T.C.E. Cheng, Bertrand M.T. Lin
Management Science
294
피인용
5.3
FWCI
1
IS/마케팅/OM 탑저널 피인용
19
IS/마케팅/OM 탑저널 참고문헌
- 주제작업장 일정 최적화 · 생산·최적화
01Abstract
This paper considers minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. After problem formulation, we present a proof to show that the general version of this problem is strongly NP-complete. We then discuss a few polynomially solvable cases of the problem and present the solution algorithms. Next, a branch and bound solution scheme is suggested. Finally, three heuristics to find approximate solutions to the general problem are proposed and their error bounds are analyzed.
02연구 흐름
불러오는 중…
03비슷한 논문
불러오는 중…
04이후 연구
불러오는 중…
05선행 연구
불러오는 중…
06서지 정보
- 저널Management Science · 39(5) · 616–625
- 토픽Scheduling and Optimization Algorithms · Industrial and Manufacturing Engineering
- DOI10.1287/mnsc.39.5.616
- 저자Chung‐Yee Lee, T.C.E. Cheng, Bertrand M.T. Lin