首页> 外文会议>Simulation Conference >A REINFORCEMENT LEARNING ALGORITHM TO MINIMIZE THE MEAN TARDINESS OF A SINGLE MACHINE WITH CONTROLLED CAPACITY
【24h】

A REINFORCEMENT LEARNING ALGORITHM TO MINIMIZE THE MEAN TARDINESS OF A SINGLE MACHINE WITH CONTROLLED CAPACITY

机译:一种加强学习算法,以最大限度地减少控制容量的单机的平均慢性

获取原文

摘要

In this work, we consider the problem of scheduling arriving jobs to a single machine where the objective is to minimize the mean tardiness. The scheduler has the option of reducing the processing time by half through the employment of an extra worker for an extra cost per job (setup cost). The scheduler can also choose from a number of dispatching rules. To find a good policy to be followed by the scheduler, we implemented a λ-SMART algorithm to do an on-line optimization for the studied system. The found policy is only optimal with respect to the state representation and set of actions available, however, we believe that the developed policies are easy to implement and would result in considerable savings as shown by the numerical experiments conducted.
机译:在这项工作中,我们认为将到达工作的问题到目标是最小化平均迟到的机器。调度程序可以选择通过额外工作人员的额外成本来将处理时间减少一半,以获得每份工作的额外费用(设置成本)。调度程序还可以从许多调度规则中进行选择。要找到调度程序之后的良好政策,我们实现了一个λ-Smart算法,用于对研究系统进行在线优化。对于国家表示和可用的一组行动,发现的政策仅是最佳的,但是,我们认为,发达的政策很容易实现,并且会导致相当大的节省,如图所示的数值实验所示。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号