首页> 外文期刊>Computers & Industrial Engineering >Single-machine group scheduling with new models of position-dependent processing times
【24h】

Single-machine group scheduling with new models of position-dependent processing times

机译:具有基于位置的处理时间新模型的单机组调度

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

摘要

We propose new models of position-dependent processing times for single-machine group scheduling problems. The two objectives of the scheduling problems are to minimize the makespan and the total completion time, respectively. We present polynomial-time algorithms to solve the problems.
机译:针对单机组调度问题,我们提出了与位置有关的处理时间的新模型。调度问题的两个目标是分别使制造时间和总完成时间最小化。我们提出多项式时间算法来解决这些问题。

著录项

  • 来源
    《Computers & Industrial Engineering》 |2018年第3期|1-5|共5页
  • 作者单位

    Department of Information Technology, Zhejiang Institute of Economics and Trade;

    School of Management and E-Business, Contemporary Business and Trade Research Center, Zhejiang Gongshang University;

    School of Management and E-Business, Contemporary Business and Trade Research Center, Zhejiang Gongshang University;

    Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University;

    School of Information Science and Engineering, Shenyang University of Technology;

    School of Management and E-Business, Contemporary Business and Trade Research Center, Zhejiang Gongshang University;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Scheduling; Single-machine; Group technology; Makespan; Total completion time; Learning effect; Aging effect;

    机译:调度;单机;分组技术;Makespan;总完成时间;学习效果;老化效果;

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号