The Single Machine Parallel Batch Scheduling Problem with Job Compatibility Constraints

被引：2

作者：

ZHANG Qunfa LIN Yixun Research Center of Fictitious Economy and ManagementNankai UniversityTianjin Department of MathematicsZhengzhou Universityghengzhou ^{[1
,2
,1
,3000712
,450052
]}

机构：

来源：

数学季刊 | 2007年 / 04期

关键词：

scheduling; hatching; makespan; compatibility;

D O I：

暂无

中图分类号：

TP11 [自动化系统理论];

学科分类号：

0711 ; 071102 ; 0811 ; 081101 ; 081103 ;

摘要：

<正>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.

引用

页码：597 / 601

页数：5