...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International journal of production economics >Scheduling controllable processing time jobs with position-dependent workloads
【24h】

Scheduling controllable processing time jobs with position-dependent workloads

机译：使用与位置相关的工作负荷来调度可控制的处理时间作业

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In various real life applications job processing times are controllable through the allocation of a limited resource. To date research has been conducted under the assumption that the relationship between the amount of resource allocated to a job and its processing time is independent of the number of tasks processed previously. However, there exist many manufacturing and service systems where workers and machines acquire, develop and refine skills through the repetition of identical or similar operations. In this paper we consider a scheduling model where job processing times are a convex function of the amount of resource they are allocated. In addition, we assume that the parameters of this function are position-dependent, i.e., vary with the job's position in the sequence. This assumption reflects general processes of learning or aging, or a combination of both. We first focus on a single machine setting and the makespan and total flowtime criteria. We show that the combined problem of finding an optimal job sequence and an optimal resource allocation can be solved in O(n(3)) time. We show that our algorithm can be used to address a bicriteria objective comprising of a linear combination of makespan and the total flowtime criteria on a single machine. We then extend the results to a parallel machine setting for the total flowtime criteria. Crown Copyright (C) 2015 Published by Elsevier B.V. All rights reserved.
机译：在各种实际应用中，可以通过分配有限的资源来控制作业的处理时间。迄今为止，已经在假设分配给作业的资源量与其处理时间之间的关系与先前处理的任务数量无关的假设下进行了研究。但是，存在许多制造和服务系统，工人和机器通过重复相同或相似的操作来获取，发展和完善技能。在本文中，我们考虑了一个调度模型，其中作业处理时间是分配的资源量的凸函数。另外，我们假定此函数的参数与位置有关，即随序列中作业的位置而变化。该假设反映了学习或衰老的一般过程，或两者的结合。我们首先关注单个机器设置以及制造时间和总流动时间标准。我们表明，可以在O（n（3））时间内解决找到最佳作业序列和最佳资源分配的组合问题。我们证明了我们的算法可用于解决双向标准目标，该目标包括一台机器上的制造期和总流动时间标准的线性组合。然后，我们将结果扩展到并行机器设置中，以符合总流动时间标准。 Crown版权所有（C）2015，Elsevier B.V.保留所有权利。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号