The copy method for the batching scheduling problems is first degigned, and then applied to prove the NP-Completeness of minsum and minmax problems in the batching scheduling.

• 摘要首次提出分批排序问题中的复制法，并用其证明瞭分批排序中的极小化求和问题以及极小化极大问题的NP-完备性。