Two-Agent Single-Machine Scheduling with Resource-Dependent Starting Times
Joint Authors
Source
Mathematical Problems in Engineering
Issue
Vol. 2013, Issue 2013 (31 Dec. 2013), pp.1-5, 5 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2013-08-19
Country of Publication
Egypt
No. of Pages
5
Main Subjects
Abstract EN
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 U.
The optimal properties and the optimal polynomial time algorithms are proposed to solve the scheduling problems.
American Psychological Association (APA)
Liu, Peng& Tian, Xiaoyu. 2013. Two-Agent Single-Machine Scheduling with Resource-Dependent Starting Times. Mathematical Problems in Engineering،Vol. 2013, no. 2013, pp.1-5.
https://search.emarefa.net/detail/BIM-1010783
Modern Language Association (MLA)
Liu, Peng& Tian, Xiaoyu. Two-Agent Single-Machine Scheduling with Resource-Dependent Starting Times. Mathematical Problems in Engineering No. 2013 (2013), pp.1-5.
https://search.emarefa.net/detail/BIM-1010783
American Medical Association (AMA)
Liu, Peng& Tian, Xiaoyu. Two-Agent Single-Machine Scheduling with Resource-Dependent Starting Times. Mathematical Problems in Engineering. 2013. Vol. 2013, no. 2013, pp.1-5.
https://search.emarefa.net/detail/BIM-1010783
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1010783