Parallel Machine Scheduling Problem with Time Windows(PMSPTW) can be described as scheduling N jobs on M nonhomogeneous parallel machines in order to maximize the contributions of jobs scheduled.

• 具有时间窗口约束的并行机床调度问题可以被描述为在M台互不相同机器上安排加工N个工件。