数学季刊（英文版）
數學季刊（英文版）
수학계간（영문판）
CHINESE QUARTERLY JOURNAL OF MATHEMATICS
2007年
4期
597-601
,共5页
scheduling%batching%makespan%compatibility
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.
