title: Some single-machine scheduling problems with learning effects and two competing agents.
abstract: This study considers a scheduling environment in which there are two agents and a set of jobs, each of which belongs to one of the two agents and its actual processing time is defined as a decreasing linear function of its starting time. Each of the two agents competes to process its respective jobs on a single machine and has its own scheduling objective to optimize. The objective is to assign the jobs so that the resulting schedule performs well with respect to the objectives of both agents. The objective functions addressed in this study include the maximum cost, the total weighted completion time, and the discounted total weighted completion time. We investigate three problems arising from different combinations of the objectives of the two agents. The computational complexity of the problems is discussed and solution algorithms where possible are presented.
authors.affiliation: Mathematics Department, Zhoukou Normal University, Zhoukou 466001, China.
authors.forename: Hongjie
authors.initials: H
authors.lastname: Li
authors.affiliation: College of Mechanical and Electrical, Harbin Institute of Technology, Harbin 150001, China.
authors.forename: Zeyuan
authors.initials: Z
authors.lastname: Li
authors.affiliation: College of Sciences, East China Institute of Technology, Nanchang 330013, China ; Faculty of Science, Kunming University of Science and Technology, Kunming 650093, China.
authors.forename: Yunqiang
authors.initials: Y
authors.lastname: Yin
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D003198:Computer Simulation