A Single Machine Preemptive Scheduling Problem with Arbitrary Release Dates and Fuzzy Due Dates

被引：0
|
作者：
Yuan, Xie [1 ]
Ou, LinLin [2 ]
机构：
[1] Shanghai Dianji Univ, Sch Elect, Shanghai, Peoples R China
[2] Zhejiang Univ Technol, Dept Automat, Hangzhou, Zhejiang, Peoples R China
来源：
2009 ISECS INTERNATIONAL COLLOQUIUM ON COMPUTING, COMMUNICATION, CONTROL, AND MANAGEMENT, VOL II | 2009年
基金：
美国国家科学基金会;
关键词：
fuzzy due dates; single machine; release times; preemption; CONSTRAINTS;
D O I：
10.1109/CCCM.2009.5267472
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
Preemptive scheduling problem of a single machine subject to arbitrary release dates under uncertain situation is discussed. The release dates of jobs are independence and different with each other. Uncertainty means due dates are not accurate, which can be described by fuzzy set. The memberships of fuzzy due dates denote grade of satisfaction of completion times of corresponding jobs. The objective of the problem is to find an optimal schedule which maximizes the minimal grade of satisfaction of jobs completion times with respect to fuzzy due dates. By extending the method of corresponding problem with accurate due dates into fuzzy situation for the problem, an O(n(2)) algorithm is presented.
引用
收藏
页码：474 / +
页数：2
相关论文
共 50 条
12345