最小化提前和延误惩罚的批处理问题  

Minimizing the earliness and tardiness penalty with batch processing

作　　者：赵洪銮[1] 韩国勇[1] 张志军[1] 

机构地区：[1]山东建筑大学计算机科学与技术学院,山东济南250101

出　　处：《控制理论与应用》2012年第4期519-523,共5页Control Theory & Applications

基　　金：国家自然科学基金资助项目(60972052);山东省科技发展计划资助项目(2010GGX10129);山东省自然科学基金资助项目(Y2008G02;Y2008G29)

摘　　要：考虑机器容量有限的同时加工排序问题,为享有公共交货期窗口[e,d]的n个工件分批并排序以最小化总的赋权提前/延误惩罚.本文把窗时排序与同时加工排序结合起来研究,假设每个批的容量是b(<n,其中n为工件的个数),而且最早交货期e和最晚交货期d已知.但该问题是NP–完备的,首先给出最优排序的几条性质,进而解决了两类特殊情况.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.

关 键 词：批 交货期窗口 提前 延误 

分 类 号：F273[经济管理—企业管理] O226[经济管理—国民经济]