Minimizing Total Weighted Completion Time on Single Machine with   Past-Sequence-Dependent Setup Times and Exponential Time-Dependent and   Position-Dependent Learning Effects

Sun Kaibiao; Li Hongxing<sup>*</sup>

doi:10.1155/2009/970510

登录

免费注册

赞收藏引用

科研之友

微信

新浪微博

Facebook

分享链接

Minimizing Total Weighted Completion Time on Single Machine with Past-Sequence-Dependent Setup Times and Exponential Time-Dependent and Position-Dependent Learning Effects

作者：Sun Kaibiao; Li Hongxing^*

来源：Discrete Dynamics in Nature and Society, 2009, 2009: 970510.

DOI：10.1155/2009/970510

摘要

This paper addresses a single-machine problem in which the past-sequence-dependent (p-s-d) setup times and exponential time-dependent and position-dependent learning effects are considered. By the exponential time-dependent learning effect, it means that the processing time of a job is defined by an exponent function of the total actual processing time of the already processed jobs. The setup times are proportional to the length of the already processed jobs. The aim is to minimize the total weighted completion time, this is an NP-hard problem. Under certain conditions, it is shown that the classical WSPT rule is optimal for the problem.