A Note on Two-Agent Scheduling with Resource Dependent Release Times on a Single Machine
We consider a scheduling problem in which both resource dependent release times and two agents exist simultaneously. Two agents share a common single machine, and each agent wants to minimize a cost function dependent on its own jobs. The release time of each A-agent’s job is related to the amount...
Saved in:
| Main Authors: | , |
|---|---|
| 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/503297 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832565225977544704 |
|---|---|
| author | Peng Liu Lini Duan |
| author_facet | Peng Liu Lini Duan |
| author_sort | Peng Liu |
| collection | DOAJ |
| description | We consider a scheduling problem in which both resource dependent release times and two agents exist simultaneously. Two agents share a common single machine, and each agent wants to minimize a cost function dependent on its own jobs. The release time of each A-agent’s job is related to the amount of resource consumed. The objective is to find a schedule for the problem of minimizing A-agent’s total amount of resource consumption with a constraint on B-agent’s makespan. The optimal properties and the optimal polynomial time algorithm are proposed to solve the scheduling problem. |
| format | Article |
| id | doaj-art-41936ac73fab473e88b91a5bb71547b8 |
| 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-41936ac73fab473e88b91a5bb71547b82025-02-03T01:08:54ZengWileyDiscrete Dynamics in Nature and Society1026-02261607-887X2015-01-01201510.1155/2015/503297503297A Note on Two-Agent Scheduling with Resource Dependent Release Times on a Single MachinePeng Liu0Lini Duan1School of Management, Shenyang University of Technology, Shenyang 110870, ChinaSchool of Economics & Management, Shenyang University of Chemical Technology, Shenyang 110142, ChinaWe consider a scheduling problem in which both resource dependent release times and two agents exist simultaneously. Two agents share a common single machine, and each agent wants to minimize a cost function dependent on its own jobs. The release time of each A-agent’s job is related to the amount of resource consumed. The objective is to find a schedule for the problem of minimizing A-agent’s total amount of resource consumption with a constraint on B-agent’s makespan. The optimal properties and the optimal polynomial time algorithm are proposed to solve the scheduling problem.http://dx.doi.org/10.1155/2015/503297 |
| spellingShingle | Peng Liu Lini Duan A Note on Two-Agent Scheduling with Resource Dependent Release Times on a Single Machine Discrete Dynamics in Nature and Society |
| title | A Note on Two-Agent Scheduling with Resource Dependent Release Times on a Single Machine |
| title_full | A Note on Two-Agent Scheduling with Resource Dependent Release Times on a Single Machine |
| title_fullStr | A Note on Two-Agent Scheduling with Resource Dependent Release Times on a Single Machine |
| title_full_unstemmed | A Note on Two-Agent Scheduling with Resource Dependent Release Times on a Single Machine |
| title_short | A Note on Two-Agent Scheduling with Resource Dependent Release Times on a Single Machine |
| title_sort | note on two agent scheduling with resource dependent release times on a single machine |
| url | http://dx.doi.org/10.1155/2015/503297 |
| work_keys_str_mv | AT pengliu anoteontwoagentschedulingwithresourcedependentreleasetimesonasinglemachine AT liniduan anoteontwoagentschedulingwithresourcedependentreleasetimesonasinglemachine AT pengliu noteontwoagentschedulingwithresourcedependentreleasetimesonasinglemachine AT liniduan noteontwoagentschedulingwithresourcedependentreleasetimesonasinglemachine |