Affiliation:
1. College of Management, Xi’an University of Science and Technology, Xi’an 710054, P. R. China
2. School of Science, Shenyang Aerospace University, Shenyang 110136, P. R. China
Abstract
In this paper, we address single-machine scheduling with sum of logarithm processing times-based learning effect. Under exponential past-sequence-dependent delivery times, we proved that the makespan and total completion time minimizations can be solved by the smallest processing time (SPT) first rule. Under the agreeable weight condition and agreeable due date condition, we show that the total weighted completion time minimization and maximum tardiness minimization can be solved in polynomial time, respectively.
Funder
Humanity and Social Science Youth Foundation of Ministry of Education of China
Natural Science Basic Research Plan in Shaanxi Province of China
China Postdoctoral Science Foundation
Postdoctoral Science Foundation in Shaanxi Province of China
LiaoNing Revitalization Talents Program
Publisher
World Scientific Pub Co Pte Ltd
Subject
Management Science and Operations Research,Management Science and Operations Research
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献