Chinese Quarterly Journal of Mathematics ›› 2007, Vol. 22 ›› Issue (4): 597-601.

Previous Articles     Next Articles

The Single Machine Parallel Batch Scheduling Problem with Job Compatibility Constraints

  

  1. 1.Research Center of Fictitious Economy and Management,Nankai University,Tianjin 300071;2. Department of Mathematics,Zhengzhou University,ghengzhou 450052
  • Received:2004-07-03 Online:2007-12-30 Published:2023-10-23
  • About author: ZHANG Qun-fa(1976-), male, native of Zhengzhou, Henan, a doctor of Research Center of Fic- titious Economy and Management, Nankai University, engages in fictitious economy; LIN Yi-xun(1937-), male, native of Zhengzhou, Henan, a professor of Zhengzhou University, engages in graph theory and combinatorial optimization;

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.

Key words: scheduling, batching, makespan, compatibility

CLC Number: