Some Single-Machine Scheduling Problems with Learning Effects and Two Competing Agents
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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2014/471016 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849686591781470208 |
|---|---|
| author | Hongjie Li Zeyuan Li Yunqiang Yin |
| author_facet | Hongjie Li Zeyuan Li Yunqiang Yin |
| author_sort | Hongjie Li |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-bfd27805c1b74b7e9d5869b9dfcefd90 |
| institution | DOAJ |
| issn | 2356-6140 1537-744X |
| language | English |
| publishDate | 2014-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | The Scientific World Journal |
| spelling | doaj-art-bfd27805c1b74b7e9d5869b9dfcefd902025-08-20T03:22:39ZengWileyThe Scientific World Journal2356-61401537-744X2014-01-01201410.1155/2014/471016471016Some Single-Machine Scheduling Problems with Learning Effects and Two Competing AgentsHongjie Li0Zeyuan Li1Yunqiang Yin2Mathematics Department, Zhoukou Normal University, Zhoukou 466001, ChinaCollege of Mechanical and Electrical, Harbin Institute of Technology, Harbin 150001, ChinaCollege of Sciences, East China Institute of Technology, Nanchang 330013, ChinaThis 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.http://dx.doi.org/10.1155/2014/471016 |
| spellingShingle | Hongjie Li Zeyuan Li Yunqiang Yin Some Single-Machine Scheduling Problems with Learning Effects and Two Competing Agents The Scientific World Journal |
| title | Some Single-Machine Scheduling Problems with Learning Effects and Two Competing Agents |
| title_full | Some Single-Machine Scheduling Problems with Learning Effects and Two Competing Agents |
| title_fullStr | Some Single-Machine Scheduling Problems with Learning Effects and Two Competing Agents |
| title_full_unstemmed | Some Single-Machine Scheduling Problems with Learning Effects and Two Competing Agents |
| title_short | Some Single-Machine Scheduling Problems with Learning Effects and Two Competing Agents |
| title_sort | some single machine scheduling problems with learning effects and two competing agents |
| url | http://dx.doi.org/10.1155/2014/471016 |
| work_keys_str_mv | AT hongjieli somesinglemachineschedulingproblemswithlearningeffectsandtwocompetingagents AT zeyuanli somesinglemachineschedulingproblemswithlearningeffectsandtwocompetingagents AT yunqiangyin somesinglemachineschedulingproblemswithlearningeffectsandtwocompetingagents |