首页> 美国政府科技报告 >Minimizing Maximum Earliness and Maximum Lateness on a Single Machine
【24h】

Minimizing Maximum Earliness and Maximum Lateness on a Single Machine

机译:最大限度地减少单台机器的最大提前度和最大延迟

获取原文

摘要

A set of n jobs has to be scheduled on a single machine which can handle only onejob at a time. Each job requires a given positive uninterrupted processing time and has a given due date. The problem is to find a schedule that minimizes a function of maximum earliness and maximum lateness that is nondecreasing in both arguments. O(n squared log n) algorithms are presented for the variant in which idle time is not allowed and for the special case in which the objective function is linear. The problem is proved np-hard if neither of these restrictions is imposed.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号