Taboo Search Based Rolling Horizon Approach to Dynamic Single-maching Scheduling With Earlines/tradiness Penalties
文献类型：会议论文
| 作者 | Liang W(梁炜) ; Yu HB(于海斌)
|
| 出版日期 | 2001 |
| 会议名称 | International Conference on Modeling and Simulation in distribution Applications |
| 会议日期 | September 25-27, 2001 |
| 会议地点 | Changsha, China |
| 关键词 | dynamic scheduling rolling horizon control taboo search(TS) single machine weighted earliness/tardiness(E/T) problems |
| 页码 | 373-377 |
| 通讯作者 | 梁炜 |
| 中文摘要 | In this paper, the single machine scheduling problem with earliness and tardiness(E/T) penalties in dynamic environment is studied, and presents a Taboo Search(TS) method combined with rolling horizon for it. This approach, can select window size from the rule base according to the requirement of system. And the paper analysis the function of rules and TS with the thought of cybernetics. In our simulation experiments, results obtained from windowed TS were compared to those obtained from dispatching rules that have been determined to perform well for performance measures with due dates. It can be observed that the designed algorithm outperforms the other approaches in the case of penalties, and the proposed approach owns quick computation speed so that it can meetthe requirements of dynamic scheduling. |
| 产权排序 | 1 |
| 会议录 | Proceedings of the International Conference on Modeling and Simulation in distribution Applications
 |
| 语种 | 英语 |
| ISBN号 | 7-81024-781-6 |
| 源URL | [http://ir.sia.cn/handle/173321/9732]  |
| 专题 | 沈阳自动化研究所_工业信息学研究室_工业控制系统研究室 |
| 推荐引用方式 GB/T 7714 | Liang W,Yu HB. Taboo Search Based Rolling Horizon Approach to Dynamic Single-maching Scheduling With Earlines/tradiness Penalties[C]. 见:International Conference on Modeling and Simulation in distribution Applications. Changsha, China. September 25-27, 2001. |
入库方式： OAI收割
来源：沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。