The problem of n jobs to be processed on single batching machine with a capacity to minimize the total weighted completion time is discussed.

• 摘要批处理机总加权完成时间最小化问题的复杂性目前还没有确定，因此有必要研究该问题的启发式算法。