| 引用本文: | 赵洪銮,韩国勇,张志军.最小化提前和延误惩罚的批处理问题[J].控制理论与应用,2012,29(4):519~523.[点击复制] |
| ZHAO Hong-luan,HAN Guo-yong,ZHANG Zhi-jun.Minimizing the earliness and tardiness penalty with batch processing[J].Control Theory and Technology,2012,29(4):519~523.[点击复制] |
|
| 最小化提前和延误惩罚的批处理问题 |
| Minimizing the earliness and tardiness penalty with batch processing |
| 摘要点击 2345 全文点击 1582 投稿时间：2010-06-07 修订日期：2010-10-14 |
| 查看全文 查看/发表评论 下载PDF阅读器 |
| DOI编号 |
| 2012,29(4):519-523 |
| 中文关键词 批 交货期窗口 提前 延误 |
| 英文关键词 batch due window earliness tardiness |
| 基金项目 国家自然科学基金资助项目(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. |
|
|
|
|
|