检索结果-南通市图书馆

Single machine stochastic JIT scheduling problem subject to machine breakdowns

Science China Mathematics 2008年第2期51卷 273-292页

作者： TANG HengYong ZHAO ChuanLi CHENG CongDian College of Mathematics and Systems Science Shenyang Normal UniversityShenyang110034China

In this paper we research the single machine stochastic JIT scheduling problem subject to the machine breakdowns for preemptive-resume and *** objective function of the problem is the sum of squared deviations of the job-expected completion times from the due *** preemptive-resume,we show that the optimal sequence of the SSDE problem is V-shaped with respect to expected processing *** a dynamic programming algorithm with the pseudopolynomial time complexity is *** discuss the difference between the SSDE problem and the ESSD problem and show that the optimal solution of the SSDE problem is a good approximate optimal solution of the ESSD problem,and the optimal solution of the SSDE problem is an optimal solution of the ESSD problem under some *** preemptive-repeat,the stochastic JIT scheduling problem has not been solved since the variances of the completion times cannot be *** replace the ESSD problem by the SSDE *** show that the optimal sequence of the SSDE problem is V-shaped with respect to the expected occupying *** a dynamic programming algorithm with the pseudopolynomial time complexity is given.A new thought is advanced for the research of the preemptive-repeat stochastic JIT scheduling problem.

关键词： stochastic JIT scheduling machine breakdowns preemptive-resume preemptive-repeat sum of squared deviations of the expected completion times from the due date 90b36 68M20

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Scheduling jobs on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties

引用

Science China Mathematics 2008年第5期51卷 864-879,881-888+880页

作者： CHENG CongDian TANG HengYong ZHAO ChuanLi College of Mathematics and Systems Science Shenyang Normal UniversityShenyang 110034China

This article addresses the problem of scheduling n jobs with a common due date on a machine subject to stochastic breakdowns to minimize absolute early-tardy *** investigate the problem under the conditions that the uptimes follow an exponential distribution,and the objective measure in detail is to minimize the expected sum of the absolute deviations of completion times from the common due *** proceed to study in two versions (the downtime follows an exponential distribution or is a constant entailed for the repeat model job),one of which is the so-called preempt- resume version,the other of which is the preempt-repeat *** terms of work have been done.(i)Formulations and Preliminaries.A few of necessary definitions,relations and basic facts are *** particular,the conclusion that the expectation of the absolute deviation of the completion time about a job with deterministic processing time t from a due date is a semi-V-shape function in t has been proved.(ii) Properties of Optimal Solutions.A few characteristics of optimal solutions are *** importantly,the conclusion that optimal solutions possess semi-V- shape property has been proved.(iii) *** computing problems on searching for optimal solutions are discussed.

关键词： scheduling stochastic breakdowns due date absolute early-tardy penalty V-shape 90b36 68M20 60K37

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：