RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제
      • 좁혀본 항목 보기순서

        • 원문유무
        • 원문제공처
        • 등재정보
        • 학술지명
        • 주제분류
        • 발행연도
        • 작성언어
        • 저자
          펼치기

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • KCI등재

        Nonlinear regression models based on the normal mean–variance mixture of Birnbaum–Saunders distribution

        Mehrdad Naderi,Alireza Arabpour,Tsung-I Lin,Ahad Jamalizadeh 한국통계학회 2017 Journal of the Korean Statistical Society Vol.46 No.3

        This paper presents a new extension of nonlinear regression models constructed by assuming the normal mean–variance mixture of Birnbaum–Saunders distribution for the unobserved error terms. A computationally analytical EM-type algorithm is developed for computing maximum likelihood estimates. The observed information matrix is derived for obtaining the asymptotic standard errors of parameter estimates. The practical utility of the methodology is illustrated through both simulated and real data sets.

      • KCI등재

        A Multi-Objective Evolutionary Algorithm for Scheduling Flexible Manufacturing Systems

        Mehrdad Nouri Koupaei,Mohammad Mohammadi,Bahman Naderi 대한산업공학회 2017 Industrial Engineeering & Management Systems Vol.16 No.2

        In recent decades, flexible manufacturing systems have emerged as a response to market demands of high product diversity. Scheduling is one important phase in production planning in all manufacturing systems. Although scheduling in classical manufacturing systems, such as flow and job shops, are well studied. Rarely, any paper studies scheduling of the more recent flexible manufacturing system. Since the problem class is NP-hard, different scheduling algorithms such as genetic algorithm (GA), simulated annealing (SA) algorithm, memetic algorithm (MA) and particle swarm algorithm (PSA) can be designed to solve this problem. This paper investigates a multi-objective evolutionary algorithm for scheduling flexible manufacturing systems to minimizing makespan, earliness and tardiness and startup costs. The distinctive feature of the proposed multi-objective evolutionary algorithm is its ability to search the solution space by an intelligent method, which is unlike other meta-heuristic algorithms avoid the coincidental method. Also, answer with the best quality and highest dispersion to obtain the dominant answer is used. Finally, we carry out computational experiments to demonstrate the effectiveness of our algorithm. The results show that the proposed algorithm has the ability to achieve the good solutions in reasonable computational time.

      • SCOPUSKCI등재

        A Multi-Objective Evolutionary Algorithm for Scheduling Flexible Manufacturing Systems

        Koupaei, Mehrdad Nouri,Mohammadi, Mohammad,Naderi, Bahman Korean Institute of Industrial Engineers 2017 Industrial Engineeering & Management Systems Vol.16 No.2

        In recent decades, flexible manufacturing systems have emerged as a response to market demands of high product diversity. Scheduling is one important phase in production planning in all manufacturing systems. Although scheduling in classical manufacturing systems, such as flow and job shops, are well studied. Rarely, any paper studies scheduling of the more recent flexible manufacturing system. Since the problem class is NP-hard, different scheduling algorithms such as genetic algorithm (GA), simulated annealing (SA) algorithm, memetic algorithm (MA) and particle swarm algorithm (PSA) can be designed to solve this problem. This paper investigates a multi-objective evolutionary algorithm for scheduling flexible manufacturing systems to minimizing makespan, earliness and tardiness and startup costs. The distinctive feature of the proposed multi-objective evolutionary algorithm is its ability to search the solution space by an intelligent method, which is unlike other meta-heuristic algorithms avoid the coincidental method. Also, answer with the best quality and highest dispersion to obtain the dominant answer is used. Finally, we carry out computational experiments to demonstrate the effectiveness of our algorithm. The results show that the proposed algorithm has the ability to achieve the good solutions in reasonable computational time.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼