http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 주제어 : Assembly-type Flowshop (검색결과 6 건)
- 무료
- 기관 내 무료
- 유료
-
부품외주를 고려한 조립형 Flowshop 일정계획 해법 개선
윤상흠,전재호 한국산업경영시스템학회 2008 한국산업경영시스템학회지 Vol.31 No.2
This paper improves algorithms for an assembly-type flowshop scheduling problem in which each job is to assemble two types of components and makespan is the objective measure. For the assembly, one type of the components is outsourced with job-dependent lead time but the other type is fabricated in-house. When both components for a job are prepared, the assembly operation for the job can be started. This problem had been proved to be NP-Complete, so branch-and-bound (B&B) and heuristic algorithms have already been developed. In this paper, we suggest other dominance rules, lowerbound and heutistic algorithms. Also, we develop a new B&B algorithm using these improved bound and dominance rules. The suggested heuristics and B&B algorithm are compared with existing algorithms on randomly-generated test problems.
-
부품외주를 고려한 조립형 Flowshop 일정계획문제 연구
전재호 한국산업경영시스템학회 2006 한국산업경영시스템학회지 Vol.29 No.4
This paper considers an assembly-type flowshop scheduling problem in which each job is assembled with two types of components. One type of the components is outsourced with positive lead time but the other type is fabricated in-house at the first stage. The two types of the components should be prepared at the first stage before starting the assembly operation for each job at the second stage. The objective is to schedule the jobs so that the makespan is minimized. Some solution properties and lower bounds are derived and incorporated into a branch and bound algorithm. Also, an efficient heuristic is developed. The performances of the proposed branch and bound algorithm and heuristic are evaluated through computational experiments.
-
총 납기지연시간 최소화를 위한 두 단계 조립시스템에서 일정계획에 관한 연구
하귀룡(Gui Ryong Ha),이익선(Ik Sun Lee),윤상흠(Sang Hum Yoon) 한국경영과학회 2008 한국경영과학회지 Vol.33 No.3
This paper considers a scheduling problem to minimize the total tardiness in the two-stage assembly-type flowshop. The system is composed of multiple fabrication machines in the first stage and a finai-assembly machine in the second stage. Each job consists of multiple tasks, each task is performed on the fabrication machine specified in advance. After all the tasks of a job are finished, the assembly task can be started on the final-assembly machine. The completion time of a job is the time that the assembly task for the job is completed. The objective of this paper is to find the optimal schedule minimizing the total tardiness of a group of jobs. In the problem analysis, we first derive three solution properties to determine the sequence between two consecutive jobs. Moreover, two lower objective bounds are derived and tested along with the derived properties within a branch-and-bound scheme. Two efficient heuristic algorithms are also developed. The overall performances of the proposed properties, branch-and-bound and heuristic algorithms are evaluated through numerical experiments.
-
대기시간을 허용하지 않는 두 단계 조립시스템에서 총 작업완료시간 최소화를 위한 일정계획 연구
한준희,정봉주,이주용,심상오 한국경영과학회 2019 經營 科學 Vol.36 No.4
This research investigates a no-wait two-stage assembly-type flowshop for the objective of minimizing total completion times. The first stage consists of m machines on which mtypes of components are fabricated, while the second stage has a single-machine on which thosecomponents are assembled. In the problem, the assembly operations in the second stage should be started immediately after those fabrications are completed in the first stage. This problem is modeled in a mathematical programming formulation and the optimal solutions are obtained by CPLEX. Since this problem is known to be NP-complete, heuristic algorithms are proposed to solve the large sized problem within a short computation time. Computational experiments on randomly generated problem instances are done to evaluate the performance of the algorithms and the results are reported.
-
부품 생산과 조립으로 구성된 2단계 조립 일정계획의 Flowtime 최소화 연구
이익선,윤상흠,하귀용,전재호 한국산업경영시스템학회 2010 한국산업경영시스템학회지 Vol.33 No.4
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 properties and propose three heuristic algorithms. Also, a mixed-integer programming model is developed and used to generate a lower bound for evaluating the performance of proposed heuristics. Numerical experiments demonstrate that the proposed heuristics are superior over those of previous research.
-
2단계 조립일정계획의 총작업완료시간 최소화 알고리즘 연구
전재호 忠州大學校 2008 한국교통대학교 논문집 Vol.43 No.-
The n-job two-stage assembly scheduling problem is studied in this paper, with the criterion of minimizing the sum of job completion times. A mixed-integer programming model for the problem is developed and used to generate a lower bound by linear programming relaxation. Some solution properties are derived and incorporated into three heuristic algorithms. The computational results demonstrate that the performance of the proposed heuristic algorithms is superior over previous ones.
ScienceON
코리아스칼라연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
