According to constraint conditions of concurrent open-shop and its description in mathematical language, the integer programming model of this scheduling problem, applied to the IBM ILOG CPLEX OPTIMIZATION mathematical optimization software combined with the five groups of numerical examples verify the correctness of the established model, is set up. Integer programming model can not only use mathematical language to describe the scheduling problem, and if we make a traversal of the whole solution space in established model, then we can get the exact solution of the problem.
목차
Abstract 1. Introduction 2. The Precise Solution to the Scheduling Problem 3. Mathematical Model of Concurrent Open-Shop Scheduling Problem 3.1. Modeling Method Introduction 3.2. Integer Programming model based on Workpiece’s Completion Time 3.3. The Integer Programming Model based on Workpiece’s Processing Order 4. Integer Planning Model Validation 4.1. The Simulation for Integer Programming Model 4.3. Analysis of Simulation Data References
키워드
Open-shopworkpiececoncurrent open shop scheduling
저자
YanMin Ma [ School of computer and information engineering Harbin University of Commerce Harbin, China ]
Di Jin [ School of computer and information engineering Harbin University of Commerce Harbin, China ]
보안공학연구지원센터(IJUNESST) [Science & Engineering Research Support Center, Republic of Korea(IJUNESST)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of u- and e- Service, Science and Technology
간기
격월간
pISSN
2005-4246
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of u- and e- Service, Science and Technology Vol.6 No.5