%0 Journal Article
%T Earliness-Tardiness Job Scheduling Problem with a Common Due Window on Non-uniform Machines<br>带公共交货期窗口的提前/拖期非等同多机调度问题
%A HUANG De cai
%A ZHU Yi
%A |hua
%A WANG Wan
%A |liang
%A <br>黄德才
%J 系统工程理论与实践
%D 2001
%I 
%X 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.
%K earliness-tardiness
%K JIT
%K due window
%K job scheduling<br>提前/拖期
%K 基于准时制
%K 交货期窗口
%K 零件排序
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=962324E222C1AC1D&jid=1D057D9E7CAD6BEE9FA97306E08E48D3&aid=9BBCE61F3F94713D&yid=14E7EF987E4155E6&vid=659D3B06EBF534A7&iid=E158A972A605785F&sid=0401E2DB1F51F8DE&eid=CB423C9A71560A74&journal_id=1000-6788&journal_name=系统工程理论与实践&referenced_num=1&reference_num=9