Scheduling with deteriorating jobs and learning effects

被引：12

作者：

Yang, Dar-Li ^{[1
]}

Kuo, Wen-Hung ^{[1
]}

机构：

[1] Natl Formosa Univ, Dept Informat Management, Yunlin 632, Taiwan

来源：

APPLIED MATHEMATICS AND COMPUTATION | 2011年 / 218卷 / 05期

关键词：

Scheduling; Deteriorating jobs; Learning effect; Makespan; Tardy job; DEPENDENT PROCESSING TIMES; SINGLE-MACHINE; LINEAR DETERIORATION; SHAPED POLICIES; MAKESPAN; MINIMIZE; CURVES;

D O I：

10.1016/j.amc.2011.07.023

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

This paper studies a single machine scheduling problem simultaneously with deteriorating jobs and learning effects. The objectives are to minimize the makespan and the number of tardy jobs, respectively. Two polynomial time algorithms are proposed to solve these problems optimally. (C) 2011 Elsevier Inc. All rights reserved.

引用

页码：2069 / 2073

页数：5

共 23 条

[1]

Alidaee B, 1999, J OPER RES SOC, V50, P711, DOI 10.2307/3010325

[2]

[Anonymous], 2004, Int. J. Bus. Econom.

[3] Minimizing maximum lateness under linear deterioration [J].