Single-machine scheduling with learning functions

被引：11
|
作者：
Wang, Ji-Bo [1 ,2 ]
Wang, Dan [1 ]
Zhang, Guo-Dong [3 ]
机构：
[1] Shenyang Inst Aeronaut Engn, Sch Sci, Operat Res & Cybernet Inst, Shenyang 110136, Peoples R China
[2] Xi An Jiao Tong Univ, Knowledge Management & Innovat Res Ctr, Xian 710049, Peoples R China
[3] Shenyang Inst Aeronaut Engn, Sch Comp, Shenyang 110136, Peoples R China
来源：
APPLIED MATHEMATICS AND COMPUTATION | 2010年 / 216卷 / 04期
基金：
美国国家科学基金会;
关键词：
Scheduling; Single machine; Learning effect; Weighted sum of completion times; Maximum lateness; TOTAL COMPLETION-TIME; 2-MACHINE FLOWSHOP; JOBS; DETERIORATION; CURVES;
D O I：
10.1016/j.amc.2010.02.020
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this study we consider the single-machine scheduling problems with a sum of-processing- times-based learning effect. The sum of-processing-times-based learning effect of a job is assumed to be a function of the sum of the normal processing time of the already processed jobs. The objective is to minimize one of two regular objective functions, namely the weighted sum of completion times and the maximum lateness. We use the weighted shortest processing time (WSPT) rule and the earliest due date (EDD) rule as heuristics for the general cases and analyze their worst-case error bounds. We also provide computational results to evaluate the performance of the heuristics. (C) 2010 Elsevier Inc. All rights reserved.
引用
收藏
页码：1280 / 1286
页数：7
相关论文
共 50 条
12345