원문정보
보안공학연구지원센터(IJUNESST)
International Journal of u- and e- Service, Science and Technology
Vol.6 No.5
2013.10
pp.1-16
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
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
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
저자정보
참고문헌
자료제공 : 네이버학술정보