검색결과

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

간행물

    분야

      발행연도

      -

        검색결과 7

        1.
        2011.12 KCI 등재 구독 인증기관 무료, 개인회원 유료
        Customers are generally requiring a variety of products, earlier due date, and lower price. A manufacturing process needs the efficient scheduling to meet those customer's requirements. This study proposes the novel algorithm named MJA(Minimum Job completion time and AGV time) that increases the performance of machines and AGV(Automated Guided Vehicles) in many kinds of job types. MJA optimizes the bottleneck of machines and efficiency of AGV with considering two types of dispatching at the same time. Suggested algorithm was compared with existing heuristic methods by several simulations, it performed better for reducing the time of tardiness.
        4,500원
        2.
        2006.12 KCI 등재 구독 인증기관 무료, 개인회원 유료
          This study presents the new dispatching rules for improving performance measures of job shop scheduling related to completion time and due dates. The proposed dispatching rule considers information, which includes the comparison value of job workload, w
        4,000원
        3.
        2005.03 KCI 등재 구독 인증기관 무료, 개인회원 유료
        This study presents the new dispatching rules of job shop scheduling with auxiliary resource constraint to improve the schedule performance measures related to completion time and due dates. The proposed dispatching rules consider the information of total
        4,000원
        4.
        2004.10 구독 인증기관 무료, 개인회원 유료
        This study presents the new dispatching rules of job shop scheduling with auxiliary resource constraint to improve the schedule performance measures related to completion time and duedates. The proposed dispatching rules consider the information of total work remaining and machine utilization to decrease mean flowtime and mean tardiness. The results of computer experiments show that those schedule performances are significantly improved by using the new dispatching rules. The results provide guidance for the researchers and practitioners of auxiliary resource constrained job shop scheduling to decrease mean flowtime and mean tardiness.
        4,000원
        6.
        2000.06 KCI 등재 구독 인증기관 무료, 개인회원 유료
        This paper deals with the selection of a proper dispatching rule for an one-process Job scheduling that follows a particular distribution of an order production. That is, it makes a distribution on an order per unit period and applies to simulation model that uses it. This study consists of two purposes either seeks adequately production scheduling using priority rule or seeks extension of the facilities that increase current production efficiency through computer simulation in scheduling.
        4,000원