| 三目标单机随机调度问题 |
| |
| 引用本文： | 兰继斌,陶培华. 三目标单机随机调度问题[J]. 系统工程理论与实践, 2000, 20(6): 112-114. DOI: 10.12011/1000-6788(2000)6-112 |
| |
| 作者姓名： | 兰继斌 陶培华 |
| |
| 作者单位： | 广西大学数学与信息科学系 |
| |
| 基金项目： | 广西区教育厅资助 !1999[383] |
| |
| 摘 要： | 讨论一类具有随机加工时间的单机调度问题 ,目标是确定 n个独立工件的最优排序 ,使工件提前完工时间之和 ,延误时间之和及守工时间之和的线性组合之期望值最小 .在一定条件下得出最优排序的形状.
|
| 关 键 词： | 单机调度 随机加工时间 V-型排序 |
Three Objectives Single Machine Scheduling with Random Processing |
| |
| LAN Ji-bin,TAO Pei-hua. Three Objectives Single Machine Scheduling with Random Processing[J]. Systems Engineering —Theory & Practice, 2000, 20(6): 112-114. DOI: 10.12011/1000-6788(2000)6-112 |
| |
| Authors: | LAN Ji-bin TAO Pei-hua |
| |
| Affiliation: | Dept. of Mathematics and Information,Guangxi University |
| |
| Abstract: | This paper considers the scheduling of $n$ independent jobs with random processing times in a single machine shop in which each is assigned a common due date, the objective is to determine the optimal sequencing to minimize the expectation of the linear combination of the total earlinss, total tardiness and total completion times, under appropriate assumption, the shaping of optimal sequencing is derived. |
| |
| Keywords: | single machine scheduling random processing V|shaped sequencing |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《系统工程理论与实践》浏览原始摘要信息 |
|
点击此处可从《系统工程理论与实践》下载全文 |
