RISS 학술연구정보서비스

검색
다국어 입력

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

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

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

    RISS 인기검색어

      KCI등재

      기대 평균흐름시간 최소화를 위한 단일설비 일정계획의 성능변동 분석

      한글로보기

      https://www.riss.kr/link?id=A101779572

      • 0

        상세조회
      • 0

        다운로드
      서지정보 열기
      • 내보내기
      • 내책장담기
      • 공유하기
      • 오류접수

      부가정보

      다국어 초록 (Multilingual Abstract)

      A single machine scheduling problem for jobs with stochastic processing time is considered in this study. Shortest processing time (SPT) sequencing according to the expected processing times of jobs is optimal for schedules with minimal expected mean flow time when all the jobs arrive to be scheduled and their expected processing times are known. However, SPT sequencing according to the expected processing time may not be optimal for the minimization of the mean flow time when the actual processing times of jobs are known. This study evaluates the complexity of SPT sequencing through a comparison of the mean flow times of schedules based on the expected processing times and actual processing times of randomly generated jobs. Evaluation results show that SPT sequencing according to the expected flow time exhibits chaotic variation to the optimal mean flow time. The relative deviation from the optimal mean flow time increases as the number of jobs, processing time, or coefficient of variation increases.
      번역하기

      A single machine scheduling problem for jobs with stochastic processing time is considered in this study. Shortest processing time (SPT) sequencing according to the expected processing times of jobs is optimal for schedules with minimal expected mean ...

      A single machine scheduling problem for jobs with stochastic processing time is considered in this study. Shortest processing time (SPT) sequencing according to the expected processing times of jobs is optimal for schedules with minimal expected mean flow time when all the jobs arrive to be scheduled and their expected processing times are known. However, SPT sequencing according to the expected processing time may not be optimal for the minimization of the mean flow time when the actual processing times of jobs are known. This study evaluates the complexity of SPT sequencing through a comparison of the mean flow times of schedules based on the expected processing times and actual processing times of randomly generated jobs. Evaluation results show that SPT sequencing according to the expected flow time exhibits chaotic variation to the optimal mean flow time. The relative deviation from the optimal mean flow time increases as the number of jobs, processing time, or coefficient of variation increases.

      더보기

      목차 (Table of Contents)

      • 1. 서론
      • 2. 복잡성 분석 방법
      • 3. SPT 규칙의 성능 변동 분석
      • 4. 결론
      • 참고문헌
      • 1. 서론
      • 2. 복잡성 분석 방법
      • 3. SPT 규칙의 성능 변동 분석
      • 4. 결론
      • 참고문헌
      더보기

      참고문헌 (Reference)

      1 "Wiley Online Library, Appendix A : Practical Processing Time Distributions, Principles of Sequencing and Scheduling"

      2 Law, A.M., "Simulation Modeling and Analysis" McGraw-Hill, Inc 1982

      3 Rothkopf, M. H., "Scheduling with Random Service Times" 12 : 707-713, 1966

      4 Elmaraghy, W.H., "Modelling of Manufacturing Systems Complexity" 52 (52): 363-366, 2003

      5 Papkkostas, N., "Modeling the Complexity of Manufacturing Systems using Nonlinear Dynamics Approaches" 58 : 437-440, 2009

      6 Efthymiou, K., "Manufacturing Systems Complexity Review : Challenges and Outlook" 3 (3): 644-649, 2012

      7 Efthymiou, K., "Manufacturing Systems Complexity : an Assessment of manufacturing Performance Indicators Unpredictability" 3 (3): 324-334, 2014

      8 Lawrence, S.R., "Heuristic, Optimal, Static, and Dynamic Schedules when Processing Times are Uncertain" 15 : 71-82, 1997

      9 Zhou, X., "General Stochastic Single-machine Scheduling with Regular Cost Functions" 26 : 95-108, 1997

      10 Alfaro, M.D., "Chaotic Behavior in Manufacturing Systems" 101 : 150-158, 2006

      1 "Wiley Online Library, Appendix A : Practical Processing Time Distributions, Principles of Sequencing and Scheduling"

      2 Law, A.M., "Simulation Modeling and Analysis" McGraw-Hill, Inc 1982

      3 Rothkopf, M. H., "Scheduling with Random Service Times" 12 : 707-713, 1966

      4 Elmaraghy, W.H., "Modelling of Manufacturing Systems Complexity" 52 (52): 363-366, 2003

      5 Papkkostas, N., "Modeling the Complexity of Manufacturing Systems using Nonlinear Dynamics Approaches" 58 : 437-440, 2009

      6 Efthymiou, K., "Manufacturing Systems Complexity Review : Challenges and Outlook" 3 (3): 644-649, 2012

      7 Efthymiou, K., "Manufacturing Systems Complexity : an Assessment of manufacturing Performance Indicators Unpredictability" 3 (3): 324-334, 2014

      8 Lawrence, S.R., "Heuristic, Optimal, Static, and Dynamic Schedules when Processing Times are Uncertain" 15 : 71-82, 1997

      9 Zhou, X., "General Stochastic Single-machine Scheduling with Regular Cost Functions" 26 : 95-108, 1997

      10 Alfaro, M.D., "Chaotic Behavior in Manufacturing Systems" 101 : 150-158, 2006

      11 Chryssolouris, G., "Chaos Theory in Production Scheduling" 53 : 381-383, 2004

      12 Rinnooy, Kan, "A.H.G., Machine Scheduling Problems : Classification" Complexity and Computations 1976

      더보기

      동일학술지(권/호) 다른 논문

      분석정보

      View

      상세정보조회

      0

      Usage

      원문다운로드

      0

      대출신청

      0

      복사신청

      0

      EDDS신청

      0

      동일 주제 내 활용도 TOP

      더보기

      주제

      연도별 연구동향

      연도별 활용동향

      연관논문

      연구자 네트워크맵

      공동연구자 (7)

      유사연구자 (20) 활용도상위20명

      인용정보 인용지수 설명보기

      학술지 이력

      학술지 이력
      연월일 이력구분 이력상세 등재구분
      2026 평가예정 재인증평가 신청대상 (재인증)
      2020-01-01 평가 등재학술지 유지 (재인증) KCI등재
      2017-01-01 평가 등재학술지 유지 (계속평가) KCI등재
      2013-01-01 평가 등재학술지 유지 (등재유지) KCI등재
      2010-01-01 평가 등재학술지 유지 (등재유지) KCI등재
      2008-01-01 평가 등재학술지 유지 (등재유지) KCI등재
      2006-01-01 평가 등재학술지 유지 (등재유지) KCI등재
      2004-01-01 평가 등재학술지 유지 (등재유지) KCI등재
      2001-01-01 평가 등재학술지 선정 (등재후보2차) KCI등재
      1998-07-01 평가 등재후보학술지 선정 (신규평가) KCI등재후보
      더보기

      학술지 인용정보

      학술지 인용정보
      기준연도 WOS-KCI 통합IF(2년) KCIF(2년) KCIF(3년)
      2016 0.66 0.66 0.69
      KCIF(4년) KCIF(5년) 중심성지수(3년) 즉시성지수
      0.69 0.66 1.157 0.2
      더보기

      이 자료와 함께 이용한 RISS 자료

      나만을 위한 추천자료

      해외이동버튼