首页> 美国政府科技报告 >A Note on Single Machine Sequencing with Random Processing Times.
【24h】

A Note on Single Machine Sequencing with Random Processing Times.

机译:关于随机加工时间单机排序的一点注记。

获取原文

摘要

It is shown that Lawler's Efficient (order N2) algorithm for the N job, one machine, scheduling problem, where the objective is to minimize the maximum deferral cost, subject to arbitrary precedence relationships, also applies when the processing times are random variables and the objective is to minimize the maximum expected deferral cost. Several special cases are explored. (Author)

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号