| 带工件相容约束的单机分批排序问题 |
| |
| 引用本文： | 张群发,林诒勋.带工件相容约束的单机分批排序问题[J].数学季刊,2007,22(4):597-601. |
| |
| 作者姓名： | 张群发 林诒勋 |
| |
| 作者单位： | 1.Research Center of Fictitious Economy and Management，Nankai University，Tianjin 300071;2. Department of Mathematics，Zhengzhou University，ghengzhou 450052 |
| |
| 基金项目： | Acknowledgement The authors would like to express their gratitude to Prof Lin Yixun and the referee for their solicitude. |
| |
| 摘 要： | The single machine parallel batch problem with job compatibility is considered to minimize makespan,where the job compatibility constraints are represented by a graph G.This problem is proved to be NP-hard.And when the graph G is limited to be a general bipartite,a complete bipartite and a complete m-partite graph,these problems are solved in polynomial time respectively.
|
| 关 键 词： | 批调度问题 定量 相容性 约束 |
| 文章编号： | 1002-0462（2007）04-0597-05 |
| 收稿时间： | 2004-07-03 |
| 修稿时间： | 2004年7月3日 |
The Single Machine Parallel Batch Scheduling Problem with Job Compatibility Constraints |
| |
| ZHANG Qun-fa,LIN Yi-xun.The Single Machine Parallel Batch Scheduling Problem with Job Compatibility Constraints[J].Chinese Quarterly Journal of Mathematics,2007,22(4):597-601. |
| |
| Authors: | ZHANG Qun-fa LIN Yi-xun |
| |
| Abstract: | The single machine parallel batch problem with job compatibility is considered to minimize makespan,where the job compatibility constraints are represented by a graph G.This problem is proved to be NP-hard.And when the graph G is limited to be a general bipartite,a complete bipartite and a complete m-partite graph,these problems are solved in polynomial time respectively. |
| |
| Keywords: | scheduling batching makespan compatibility |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
