Two-Agent Single-Machine Scheduling with Resource-Dependent Starting Times

Peng Liu and Xiaoyu Tian

Mathematical Problems in Engineering, 2013, vol. 2013, 1-5

Abstract:

We consider several two-agent scheduling problems with resource consumption on a single machine, where each of the agents wants to minimize a measure dependent on its own jobs. The starting time of each job of the first agent is related to the amount of resource consumed. The objective is to minimize the total amount of resource consumption of the first agent with the restriction that the makespan or the total completion time of the second agent cannot exceed a given bound . The optimal properties and the optimal polynomial time algorithms are proposed to solve the scheduling problems.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2013/805261.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2013/805261.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:jnlmpe:805261

DOI: 10.1155/2013/805261

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().