%0 Journal Article
%T Minimizing the earliness and tardiness penalty with batch processing<br>最小化提前和延误惩罚的批处理问题
%A ZHAO Hong-luan
%A HAN Guo-yong
%A ZHANG Zhi-jun
%A <br>赵洪銮
%A 韩国勇
%A 张志军
%J 控制理论与应用
%D 2012
%I 
%X The common due-window scheduling problem is concerned with the batching for minimizing the weighted earliness-and-tardiness penalties, where the jobs share a common due-window e; d]. We combine the due-window situation with the concept of batch where considering job processing in batches. The bounded version of batch scheduling is considered such that at most b jobs can be processed in a batch with b < n, the number of jobs. Furthermore, the location and size of due-window are given parametrically. The problem is NP-complete. Based on optimal properties, two special cases are discussed.
%K batch
%K due window
%K earliness
%K tardiness<br>批
%K 交货期窗口
%K 提前
%K 延误
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=970898A57DFC021F93AB51667BAED7F7&aid=7E87CD4B03A3D9AF9FE99949E06844BC&yid=99E9153A83D4CB11&vid=771469D9D58C34FF&iid=E158A972A605785F&sid=89389F643CA3F778&eid=C81D738643975BB0&journal_id=1000-8152&journal_name=控制理论与应用&referenced_num=0&reference_num=0