| 带拒绝和到达时间的单机排序问题 |
| |
| 引用本文： | 慕迪,刘培海. 带拒绝和到达时间的单机排序问题[J]. 医学教育探索, 2017, 43(6): 890-894,898 |
| |
| 作者姓名： | 慕迪 刘培海 |
| |
| 作者单位： | 华东理工大学数学系, 上海 200237,华东理工大学数学系, 上海 200237 |
| |
| 摘 要： | 研究了一个单机带拒绝的排序问题，目标函数是最小化接受工件的最大完工时间与所有被拒绝工件的拒绝费用之和。首先给出了此问题的混合整数规划模型，并得到了最优解的一些性质。最后给出了一个分支定界算法，并给出了数值模拟的结果。
|
| 关 键 词： | 排序 单机 拒绝 分支定界 |
| 收稿时间： | 2016-06-23 |
Single Machine Scheduling with Job Rejection and Release Dates |
| |
| MU Di and LIU Pei-hai. Single Machine Scheduling with Job Rejection and Release Dates[J]. Researches in Medical Education, 2017, 43(6): 890-894,898 |
| |
| Authors: | MU Di and LIU Pei-hai |
| |
| Affiliation: | Department of Mathematics, East China University of Science and Techology, Shanghai 200237, China and Department of Mathematics, East China University of Science and Techology, Shanghai 200237, China |
| |
| Abstract: | This paper considers the single machine scheduling problem with job rejection.The objective function is to minimize the sum of the maximum completion time of the job and the rejection lost of all rejected jobs.Firstly,the paper introduces a mixed integer programming model and some properties of the optimal solution.Finally,a branch-and-bound algorithm and a numerical simulation are presented. |
| |
| Keywords: | scheduling single machine rejection branch-and-bound |
|
| 点击此处可从《医学教育探索》浏览原始摘要信息 |
|
点击此处可从《医学教育探索》下载全文 |
|
