국립중앙도서관 "우편 복사 서비스"로 연결 됩니다.
KCIFlexible job-shop scheduling problem (FJSP), which is proved to be NP-hard, is an extension of the classical job-shop schedulingproblem. In this paper, we propose a new genetic algorithm (NGA) to solve FJSP to minimize makespan. This new algorithm use...
다국어 입력
あ
ぁ
か
が
さ
ざ
た
だ
な
は
ば
ぱ
ま
や
ゃ
ら
わ
ゎ
ん
い
ぃ
き
ぎ
し
じ
ち
ぢ
に
ひ
び
ぴ
み
り
う
ぅ
く
ぐ
す
ず
つ
づ
っ
ぬ
ふ
ぶ
ぷ
む
ゆ
ゅ
る
え
ぇ
け
げ
せ
ぜ
て
で
ね
へ
べ
ぺ
め
れ
お
ぉ
こ
ご
そ
ぞ
と
ど
の
ほ
ぼ
ぽ
も
よ
ょ
ろ
を
ア
ァ
カ
サ
ザ
タ
ダ
ナ
ハ
バ
パ
マ
ヤ
ャ
ラ
ワ
ヮ
ン
イ
ィ
キ
ギ
シ
ジ
チ
ヂ
ニ
ヒ
ビ
ピ
ミ
リ
ウ
ゥ
ク
グ
ス
ズ
ツ
ヅ
ッ
ヌ
フ
ブ
プ
ム
ユ
ュ
ル
エ
ェ
ケ
ゲ
セ
ゼ
テ
デ
ヘ
ベ
ペ
メ
レ
オ
ォ
コ
ゴ
ソ
ゾ
ト
ド
ノ
ホ
ボ
ポ
モ
ヨ
ョ
ロ
ヲ
―
http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
예시)
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
А
Б
В
Г
Д
Е
Ё
Ж
З
И
Й
К
Л
М
Н
О
П
Р
С
Т
У
Ф
Х
Ц
Ч
Ш
Щ
Ъ
Ы
Ь
Э
Ю
Я
а
б
в
г
д
е
ё
ж
з
и
й
к
л
м
н
о
п
р
с
т
у
ф
х
ц
ч
ш
щ
ъ
ы
ь
э
ю
я
′
″
℃
Å
￠
￡
￥
¤
℉
‰
＄
％
Ｆ
￦
㎕
㎖
㎗
ℓ
㎘
㏄
㎣
㎤
㎥
㎦
㎙
㎚
㎛
㎜
㎝
㎞
㎟
㎠
㎡
㎢
㏊
㎍
㎎
㎏
㏏
㎈
㎉
㏈
㎧
㎨
㎰
㎱
㎲
㎳
㎴
㎵
㎶
㎷
㎸
㎹
㎀
㎁
㎂
㎃
㎄
㎺
㎻
㎽
㎾
㎿
㎐
㎑
㎒
㎓
㎔
Ω
㏀
㏁
㎊
㎋
㎌
㏖
㏅
㎭
㎮
㎯
㏛
㎩
㎪
㎫
㎬
㏝
㏐
㏓
㏃
㏉
㏜
㏆
RISS 인기검색어
https://www.riss.kr/link?id=A103791012
-
저자
Imen Driss (University of Batna) ; Kinza Nadia Mouss (University of Batna) ; Assia Laggoun (University of Batna)
- 발행기관
- 학술지명
- 권호사항
-
발행연도
2015
-
작성언어
-
- 주제어
-
등재정보
KCI등재,SCIE,SCOPUS
-
자료형태
학술저널
-
수록면
1273-1281(9쪽)
-
KCI 피인용횟수
18
- 제공처
-
0
상세조회 -
0
다운로드
부가정보
다국어 초록 (Multilingual Abstract)
Flexible job-shop scheduling problem (FJSP), which is proved to be NP-hard, is an extension of the classical job-shop schedulingproblem. In this paper, we propose a new genetic algorithm (NGA) to solve FJSP to minimize makespan. This new algorithm uses a newchromosome representation and adopts different strategies for crossover and mutation. The proposed algorithm is validated on a series ofbenchmark data sets and tested on data from a drug manufacturing company. Experimental results prove that the NGA is more efficientand competitive than some other existing algorithms.
참고문헌 (Reference)
1 A. Motaghedi, "solving flexible job shop scheduling problem with multi objectives" 21 : 197-209, 2010
2 M. R. Garey, "The complexity of flow shop and job shop scheduling," 1 : 117-129, 1976
3 B. S. Girish, "Scheduling job shops associated with multiple routings with genetic and ant colony heuristics" 2008
4 P. Brandimarte, "Routing and scheduling in a flexible job shop by tabu search" 41 : 157-183, 1993
5 Wei Sun, "Research on flexible job-shop scheduling problem based on a modified genetic algorithm" 대한기계학회 24 (24): 2119-2125, 2010
6 I. Kacem, "Pareto-optimality approach for flexible job shop scheduling problems, Hybridization of evolutionary algorithms and fuzzy logic" 60 : 245-276, 2002
7 박용국, "Optimization of mixed casting processes considering discrete ingot sizes" 대한기계학회 23 (23): 1899-1910, 2009
8 K. Mesghani, "On modeling genetic algorithms for flexible job shop scheduling problems" 1998
9 H. P. Zhang, "Multistage-based genetic algorithm for flexible job shop scheduling problem" 48 : 409-425, 2005
10 L. N. Xing, "Multi population interactive coevolutionnary algorithm for flexible job shop scheduling problems" 2009
1 A. Motaghedi, "solving flexible job shop scheduling problem with multi objectives" 21 : 197-209, 2010
2 M. R. Garey, "The complexity of flow shop and job shop scheduling," 1 : 117-129, 1976
3 B. S. Girish, "Scheduling job shops associated with multiple routings with genetic and ant colony heuristics" 2008
4 P. Brandimarte, "Routing and scheduling in a flexible job shop by tabu search" 41 : 157-183, 1993
5 Wei Sun, "Research on flexible job-shop scheduling problem based on a modified genetic algorithm" 대한기계학회 24 (24): 2119-2125, 2010
6 I. Kacem, "Pareto-optimality approach for flexible job shop scheduling problems, Hybridization of evolutionary algorithms and fuzzy logic" 60 : 245-276, 2002
7 박용국, "Optimization of mixed casting processes considering discrete ingot sizes" 대한기계학회 23 (23): 1899-1910, 2009
8 K. Mesghani, "On modeling genetic algorithms for flexible job shop scheduling problems" 1998
9 H. P. Zhang, "Multistage-based genetic algorithm for flexible job shop scheduling problem" 48 : 409-425, 2005
10 L. N. Xing, "Multi population interactive coevolutionnary algorithm for flexible job shop scheduling problems" 2009
11 P. Fattahi, "Mathematical modeling and heuristic approaches to flexible job shop scheduling problems" 18 : 331-342, 2007
12 P. Brucker, "Job-shop scheduling with multipurpose machines," 45 (45): 369-375, 1990
13 J. A. Paulli, "Hierarchical approach for the FMS scheduling problem" 86 (86): 32-42, 1995
14 S. G. Pannanbalam, "Giffler and Thampson Procedure based genetic algorithms for scheduling job shops" Springer-Verbag Berlin Heidelberg 229-259, 2009
15 J. J. Palacios, "Genetic tabu search for the fuzzy flexible job shop problem" 5474-5489, 2014
16 H. Chen, "Genetic algorithm for flexible Job shop scheduling" 2 : 1120-1128, 1999
17 N. B. Ho, "GENACE : An efficient cultural algorithm for solving the flexible job shop problem" 1 : 1759-1766, 2004
18 J. C. Chen, "Flexible job shop with parallel machines using genetic algorithm and grouping genetic algorithm" 39 : 10016-10021, 2012
19 J. C. Tay, "Evolving dispatching rules using genetic programming for solving multi- objective flexible jobshop problems" 54 : 453-473, 2008
20 김남일, "Damage detection of truss structures using two-stage optimization based on micro genetic algorithm" 대한기계학회 28 (28): 3687-3695, 2014
21 I. Kacem, "Approche by localization and multiobjective evolutionary and optimization for flexible job shop scheduling problems" 32 (32): 1-13, 2002
22 Ravindra Nath Yadav, "Application of non-dominated sorting genetic algorithm for multi-objective optimization of electrical discharge diamond face grinding process" 대한기계학회 28 (28): 2299-2306, 2014
23 G. Zhang, "An effective genetic algorithm for the flexible job shop scheduling problem" 38 : 3563-3573, 2011
24 N. B. Ho, "An effective architecture for learning and evolving flexible job shop schedules" 179 : 316-333, 2007
25 J. Gao, "A hybrid of genetic algorithm and bottleneck shifting for multi objective flexible job shop scheduling problems" 53 : 149-162, 2007
26 Q. Zhang, "A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constants and bounded proceding times" 39 : 1713-1723, 2012
27 Shun-Fa Hwang, "A genetic algorithm for the optimization of fiber angles in composite laminates" 대한기계학회 28 (28): 3163-3169, 2014
28 F. Pezzela, "A genetic algorithm for flexible job shop scheduling problem" 35 (35): 3202-3212, 2007
29 F. N. Defersha, "A coase-grain parallel genetic algorithm for flexible job shop scheduling with lot streaming" 2009
동일학술지(권/호) 다른 논문
-
- 대한기계학회
- 주성민
- 2015
- KCI등재,SCIE,SCOPUS
-
- 대한기계학회
- K. Gokul Kumar
- 2015
- KCI등재,SCIE,SCOPUS
-
Influence of production parameters on gas hydrate and ice powder pelletizing
- 대한기계학회
- 송명호
- 2015
- KCI등재,SCIE,SCOPUS
-
Blade shape optimization for transonic axial flow fan
- 대한기계학회
- Peng Song
- 2015
- KCI등재,SCIE,SCOPUS
분석정보
인용정보 인용지수 설명보기
학술지 이력
| 연월일 | 이력구분 | 이력상세 | 등재구분 |
|---|---|---|---|
| 2023 | 평가예정 | 해외DB학술지평가 신청대상 (해외등재 학술지 평가) | |
| 2020-01-01 | 평가 | 등재학술지 유지 (해외등재 학술지 평가) |  |
| 2012-11-05 | 학술지명변경 | 한글명 : 대한기계학회 영문 논문집 -> Journal of Mechanical Science and Technology | |
| 2010-01-01 | 평가 | 등재학술지 유지 (등재유지) | |
| 2008-01-01 | 평가 | 등재학술지 유지 (등재유지) | |
| 2006-01-19 | 학술지명변경 | 한글명 : KSME International Journal -> 대한기계학회 영문 논문집외국어명 : KSME International Journal -> Journal of Mechanical Science and Technology | |
| 2006-01-01 | 평가 | 등재학술지 유지 (등재유지) | |
| 2004-01-01 | 평가 | 등재학술지 유지 (등재유지) | |
| 2001-01-01 | 평가 | 등재학술지 선정 (등재후보2차) | |
| 1998-07-01 | 평가 | 등재후보학술지 선정 (신규평가) |  |
학술지 인용정보
| 기준연도 | WOS-KCI 통합IF(2년) | KCIF(2년) | KCIF(3년) |
|---|---|---|---|
| 2016 | 1.04 | 0.51 | 0.84 |
| KCIF(4년) | KCIF(5년) | 중심성지수(3년) | 즉시성지수 |
| 0.74 | 0.66 | 0.369 | 0.12 |
이 자료와 함께 이용한 RISS 자료
나만을 위한 추천자료
