运筹学学报 ›› 2013, Vol. 17 ›› Issue (1): 98-105.

• 运筹学 • 上一篇    下一篇

基于加工时间之和学习效应下的单机成组排序问题

张新功1   

  1. 1. 重庆师范大学数学科学学院
  • 出版日期:2013-03-15 发布日期:2013-03-15
  • 通讯作者: 张新功 E-mail: zhangxg7980@yahoo.com.cn

Single-machine group scheduling problems with the sum-of-processing-time based on learning effect

ZHANG Xingong1   

  1. 1. College of Mathematics Science, Chongqing Normal University
  • Online:2013-03-15 Published:2013-03-15

摘要: 研究具有加工时间之和学习效应下的一个新型成组排序问题,工件的学习效应是之前工件加工时间之和的函数,组学习效应是成组加工所在的位置的函数. 考虑最大完工时间和总完工时间两个问题,证明了这两个问题都是多项式时间可解的,并提出了相应的多项式时间算法.

关键词: 单机排序, 学习效应, 成组技术, 时间表长, 总完工时间

Abstract: This paper investigates a new group scheduling problem with sum-of-processing-time based learning effect. The learning effect of a job is assumed to be a function of total processing times of jobs scheduled in front of it, the learning effect of group is assumed to a function of its position in the sequence. The goal is to minimize makespan and the total completion times under the proposed model, respectively.  Some optimal properties and optimal polynomial time algorithms to solve these problems are also provided.

Key words: single-machine, learning effect, group technology, makespan, total completion time