A Note on Two-Agent Scheduling with Resource Dependent Release Times on a Single Machine

Peng Liu and Lini Duan

Discrete Dynamics in Nature and Society, 2015, vol. 2015, 1-4

Abstract:

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.

Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/DDNS/2015/503297.pdf (application/pdf)
http://downloads.hindawi.com/journals/DDNS/2015/503297.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnddns:503297

DOI: 10.1155/2015/503297

Access Statistics for this article

More articles in Discrete Dynamics in Nature and Society from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().