검색결과

검색조건
좁혀보기
검색필터
결과 내 재검색

간행물

    분야

      발행연도

      -

        검색결과 9

        1.
        2012.09 KCI 등재 구독 인증기관 무료, 개인회원 유료
        이 논문은 병렬 설비로 이루어진 다수의 단계를 포함하는 재방문이 있는 혼합흐름공정의 계획 문제를 다룬다. 재방문작업에서 제품은 몇몇 공정을 여러 번 방문하게 되고 이로 인하여 재공의 혼잡과 장비의 유휴의 원인이 된다. 이 상황에서는 생산성과 고객 만족도를 향상 시키는 것이 중요한 이슈이다. 따라서 본 논문은 혼합흐름공정에서 스루풋을 최대화하고 지연된 고객 수요를 최소화하기 위해 우선순위 목표계획법 기반의 휴리스틱 방법들을 제안한다. 그리고 이 휴리스틱
        4,000원
        2.
        2012.05 구독 인증기관 무료, 개인회원 유료
        This paper deals with a planning problem for reentrant hybrid flow shop with serial stages consisted of parallel machines. In a reentrant operation, a product may revisit some stages several times and then it may cause the congestion of work in process (WIP) or equipment idleness. Preemptive goal programming based heuristics are proposed to maximize of throughput and to minimize of delayed customer demands in the hybrid flow shop.
        4,000원
        3.
        2011.12 KCI 등재 구독 인증기관 무료, 개인회원 유료
        To date, facility layout problems has been solved and applied for job shop situations. Since flow shop has more restrictions, the solution space is much smaller than job shop. An efficient heuristic algorithm for facility layout problems for flow shop lay
        4,000원
        4.
        2011.12 KCI 등재 구독 인증기관 무료, 개인회원 유료
        A typical job sequencing problem is studied in this research to improve productivities in manufacturing companies. The problem consists of two-stage parts and assembly processes. Two parts are provided independently each other and then two sequential asse
        4,000원
        5.
        2011.10 구독 인증기관 무료, 개인회원 유료
        This research is to sequence flow shop with two parallel parts production and two assembly machines in sequence. Two different objective functions are studied. One is to minimize total completion time and the other is to minimize the difference of 1 job completion time and total completion time. A heuristic is designed to solve the sequencing problem. Initial solution is developed in the first stage and then the initial solution is improved in the second stage. Experimental 5 job problems are used to evaluate the performance of the suggested heuristic. The optimum solutions obtained by enumeration are used to comparisons. Also 20 job problems are generated for evaluations. 100 randomly generated sequences are evaluated and proved that the distributions are normal. And then presented how good the solutions obtained by suggested method. The initial solution stage is different for the minimization of completion time differences.
        4,000원