Two-Agent Scheduling to Minimize the Maximum Cost with Position-Dependent Jobs
Author
Source
Discrete Dynamics in Nature and Society
Issue
Vol. 2015, Issue 2015 (31 Dec. 2015), pp.1-4, 4 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2015-04-12
Country of Publication
Egypt
No. of Pages
4
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Wan, Long. 2015. Two-Agent Scheduling to Minimize the Maximum Cost with Position-Dependent Jobs. Discrete Dynamics in Nature and Society،Vol. 2015, no. 2015, pp.1-4.
https://search.emarefa.net/detail/BIM-1060822
Modern Language Association (MLA)
Wan, Long. Two-Agent Scheduling to Minimize the Maximum Cost with Position-Dependent Jobs. Discrete Dynamics in Nature and Society No. 2015 (2015), pp.1-4.
https://search.emarefa.net/detail/BIM-1060822
American Medical Association (AMA)
Wan, Long. Two-Agent Scheduling to Minimize the Maximum Cost with Position-Dependent Jobs. Discrete Dynamics in Nature and Society. 2015. Vol. 2015, no. 2015, pp.1-4.
https://search.emarefa.net/detail/BIM-1060822
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1060822