A Branch-and-bound algorithm for n-job two-machine flow shop scheduling problems
文献类型：会议论文
| 作者 | Wang CE(王成恩); Chu CB(储诚斌); Jean-Marie |
| 出版日期 | 1995 |
| 会议名称 | IEEE Symposium on Emerging Technologies & Factory Automation |
| 会议日期 | October 10-13, 1995 |
| 会议地点 | Paris, France |
| 关键词 | Flow shop Scheduling Branch-and- bound algorithm Job flow time |
| 页码 | 375-383 |
| 中文摘要 | In this paper, we study the n-job two machine flow shop scheduling problem, minimizing the total job flow times. The problem is mathematically formulated, and two heuristic approaches are invented to find near optimum schedules. Then a branch-and-bound algorithm is developed to obtain the optimum schedule by improving the near optimum schedule. In the algorithm, very tight lower bounds are designed to reduce the searching space. Numerical computations demonstrate that the algorithm developed in this paper is very efficient. |
| 收录类别 | EI |
| 产权排序 | 1 |
| 会议主办者 | IEEE |
| 会议录 | IEEE Symposium on Emerging Technologies & Factory Automation
 |
| 会议录出版者 | IEEE |
| 会议录出版地 | New York |
| 语种 | 英语 |
| ISBN号 | 0-7803-2535-4 |
| 源URL | [http://ir.sia.cn/handle/173321/9200]  |
| 专题 | 沈阳自动化研究所_沈阳自动化所知识产出(2000年前) |
| 推荐引用方式 GB/T 7714 | Wang CE,Chu CB,Jean-Marie. A Branch-and-bound algorithm for n-job two-machine flow shop scheduling problems[C]. 见:IEEE Symposium on Emerging Technologies & Factory Automation. Paris, France. October 10-13, 1995. |
入库方式： OAI收割
来源：沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。