PAMS : a knowledge-based parallel machine scheduling system作業 日程計劃을 위한 專門家 體制 開發에 關한 硏究
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Lee, Jae-Kyu | - |
| dc.contributor.advisor | 이재규 | - |
| dc.contributor.author | Suh, Min-Soo | - |
| dc.contributor.author | 서민수 | - |
| dc.date.accessioned | 2011-12-14T06:03:05Z | - |
| dc.date.available | 2011-12-14T06:03:05Z | - |
| dc.date.issued | 1987 | - |
| dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=65911&flag=dissertation | - |
| dc.identifier.uri | http://hdl.handle.net/10203/44760 | - |
| dc.description | 학위논문(석사) - 한국과학기술원 : 경영과학과, 1987.2, [ iii, 54 p. ] | - |
| dc.description.abstract | The PAMS(Parallel Machine Scheduling System) is a rule-based scheduling system for parallel machine scheduling problems. The PAMS adopts status driven scheduling principle to cope with dynamic manufacturing environment. The important characteristics of PAMS include a forward chaining inferencing mechanism, high-level action commands, conflict resolution by meta-rules, coordination of multiple levels of scheduling, use of scheduling heuristics for parallel machine scheduling, and interface with an external data base management system. A prototype of PAMS is developed using C language on a super-micro computer and is applied to the dynamic scheduling problem of a sweater manufacturing company using Jacquard looms. | eng |
| dc.language | eng | - |
| dc.publisher | 한국과학기술원 | - |
| dc.title | PAMS | - |
| dc.title.alternative | 作業 日程計劃을 위한 專門家 體制 開發에 關한 硏究 | - |
| dc.type | Thesis(Master) | - |
| dc.identifier.CNRN | 65911/325007 | - |
| dc.description.department | 한국과학기술원 : 경영과학과, | - |
| dc.identifier.uid | 000851182 | - |
| dc.contributor.localauthor | Lee, Jae-Kyu | - |
| dc.contributor.localauthor | 이재규 | - |
| dc.title.subtitle | a knowledge-based parallel machine scheduling system | - |
- Appears in Collection
- MG-Theses_Master(석사논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.