...
首页> 外文期刊>Journal of intelligent & fuzzy systems: Applications in Engineering and Technology >Assignment of tasks to competing nodes when task duration times are fuzzy
【24h】

Assignment of tasks to competing nodes when task duration times are fuzzy

机译:当任务持续时间模糊时,将任务分配给竞争节点

获取原文
获取原文并翻译 | 示例

摘要

In this article, we introduce a formal scheduling algorithm that uses redirecting of tasks from a bottlenecked employee while minimizing the completion time for the scheduled jobs. The paper focuses on instances in which a number of employees are to perform several jobs that are divided into various tasks with fuzzy values for their estimated duration times. Generally, efficient job scheduling requires that task and job duration be real values. This allows for precise calculation of time interval and time delay parameters when determining a job's completion time. When the precise values of either one of these parameters is unknown, not only can the job's completion time not be minimized, but the scheduling of tasks, without regard to the possible bottlenecks, will be haphazard.
机译:在本文中,我们介绍了一种正式的调度算法,该算法使用来自瓶颈员工的任务重定向,同时最大限度地减少了计划作业的完成时间。本文重点介绍了一些实例,在该实例中,许多员工将执行多个工作,这些工作被划分为具有模糊值的各种任务,这些任务的估计持续时间是模糊的。通常,有效的作业调度要求任务和作业持续时间是真实值。在确定作业的完成时间时,这可以精确计算时间间隔和时间延迟参数。当这些参数之一的精确值未知时,不仅无法使作业的完成时间最小化,而且在不考虑可能的瓶颈的情况下进行任务调度也将是偶然的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号