Earliness-Tardiness Job Scheduling Problem with a Common Due Window on Non-uniform Machines
带公共交货期窗口的提前/拖期非等同多机调度问题

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.