Open-shop with machine availability and eligibility constraints for two-agent scheduling problem
碩士 === 中原大學 === 工業與系統工程研究所 === 99 === We consider a two-agent scheduling problems on open shop with machine availability and eligibility constraints, each agent with a set of preemptive jobs, compete to perform their respective jobs on a common processing resource. Agent a is responsible for na jobs...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/9y8twk |