带公共交货期窗口的提前/拖期非等同多机调度问题

Earliness-Tardiness Job Scheduling Problem with a Common Due Window on Non-uniform Machines

提出了公共交货期窗口下提前 /拖期惩罚的多台不同设备情形的零件排序模型 .在分析相应单机问题最优排序和最优交货期性质的基础上 ,证明该多机零件问题实际上蕴含着使系统 makespan达最小的多机零件排序问题 .由于使系统 makespan达最小的并行多机零件排序问题已被证明是 NP完全问题 ,因此提出了求解该零件排序问题的一个启发式算法 ,该算法计算复杂性低且对并行多机零件排序问题同样适用 .最后给出了两个数值例子 .

A mathematical model for earliness\|tardiness job scheduling problem with a common due window on non\|uniform machines is put forward. Because the job scheduling problem contains a problem of minimum makespan, which is NP\|complete on uniform machines, a heuristic algorithm is presented to find an approximate solution for the scheduling problem after proving an important theorem. Two numerical examples illustrate that the heuristic algorithm is very effective in obtaining near\|optimal solution.