On the Multiple-Machine Extension to a Common Due-Date Assignment and Scheduling Problem
本文纠正了Cheng关于多机交货期指派与调度问题研究中的两个错误：隐含假设所有调度起始时间为零（不保证最优性）以及忽略最优调度的V形特性（导致高估问题求解难度），并讨论了问题复杂度及其特例。
In a recent paper, Cheng considers the multiple-machine extension to a due-date assignment and scheduling problem. He implicitly assumes zero start times for all schedules (which does not ensure optimality), and overlooks the critical V-shape property for an optimal schedule (which leads him to over-estimate the effort needed to solve the problem). In this note, we correct these flaws, and also discuss the complexity of the problem and its special cases.