Two-Agent Scheduling to Minimize the Maximum Cost with Position-Dependent Jobs
This paper investigates a single-machine two-agent scheduling problem to minimize the maximum costs with position-dependent jobs. There are two agents, each with a set of independent jobs, competing to perform their jobs on a common machine. In our scheduling setting, the actual position-dependent p...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2015-01-01
|
| Series: | Discrete Dynamics in Nature and Society |
| Online Access: | http://dx.doi.org/10.1155/2015/932680 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832551373299777536 |
|---|---|
| author | Long Wan |
| author_facet | Long Wan |
| author_sort | Long Wan |
| collection | DOAJ |
| description | This paper investigates a single-machine two-agent scheduling problem to minimize the maximum costs with position-dependent jobs. There are two agents, each with a set of independent jobs, competing to perform their jobs on a common machine. In our scheduling setting, the actual position-dependent processing time of one job is characterized by variable function dependent on the position of the job in the sequence. Each agent wants to fulfil the objective of minimizing the maximum cost of its own jobs. We develop a feasible method to achieve all the Pareto optimal points in polynomial time. |
| format | Article |
| id | doaj-art-11504535136a40b4b03ee9c15bf1f04e |
| institution | Kabale University |
| issn | 1026-0226 1607-887X |
| language | English |
| publishDate | 2015-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Discrete Dynamics in Nature and Society |
| spelling | doaj-art-11504535136a40b4b03ee9c15bf1f04e2025-02-03T06:01:32ZengWileyDiscrete Dynamics in Nature and Society1026-02261607-887X2015-01-01201510.1155/2015/932680932680Two-Agent Scheduling to Minimize the Maximum Cost with Position-Dependent JobsLong Wan0School of Information Technology, Jiangxi University of Finance and Economics, Nanchang 330013, ChinaThis paper investigates a single-machine two-agent scheduling problem to minimize the maximum costs with position-dependent jobs. There are two agents, each with a set of independent jobs, competing to perform their jobs on a common machine. In our scheduling setting, the actual position-dependent processing time of one job is characterized by variable function dependent on the position of the job in the sequence. Each agent wants to fulfil the objective of minimizing the maximum cost of its own jobs. We develop a feasible method to achieve all the Pareto optimal points in polynomial time.http://dx.doi.org/10.1155/2015/932680 |
| spellingShingle | Long Wan Two-Agent Scheduling to Minimize the Maximum Cost with Position-Dependent Jobs Discrete Dynamics in Nature and Society |
| title | Two-Agent Scheduling to Minimize the Maximum Cost with Position-Dependent Jobs |
| title_full | Two-Agent Scheduling to Minimize the Maximum Cost with Position-Dependent Jobs |
| title_fullStr | Two-Agent Scheduling to Minimize the Maximum Cost with Position-Dependent Jobs |
| title_full_unstemmed | Two-Agent Scheduling to Minimize the Maximum Cost with Position-Dependent Jobs |
| title_short | Two-Agent Scheduling to Minimize the Maximum Cost with Position-Dependent Jobs |
| title_sort | two agent scheduling to minimize the maximum cost with position dependent jobs |
| url | http://dx.doi.org/10.1155/2015/932680 |
| work_keys_str_mv | AT longwan twoagentschedulingtominimizethemaximumcostwithpositiondependentjobs |