The server is under maintenance between 08:00 to 12:00 (GMT+08:00), and please visit later.
We apologize for any inconvenience caused
Login  | Sign Up  |  Oriprobe Inc. Feed
China/Asia On Demand
Journal Articles
Laws/Policies/Regulations
Companies/Products
Bookmark and Share
The Single Machine Parallel Batch Scheduling Problem with Job Compatibility Constraints
Author(s): 
Pages: 597-601
Year: Issue:  4
Journal: CHINESE QUARTERLY JOURNAL OF MATHEMATICS

Keyword:  schedulingbatchingmakespancompatibility;
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.
Related Articles
No related articles found