Table of Contents Author Guidelines Submit a Manuscript
Discrete Dynamics in Nature and Society
Volume 2015, Article ID 932680, 4 pages
Research Article

Two-Agent Scheduling to Minimize the Maximum Cost with Position-Dependent Jobs

School of Information Technology, Jiangxi University of Finance and Economics, Nanchang 330013, China

Received 9 September 2014; Accepted 5 November 2014

Academic Editor: Chin-Chia Wu

Copyright © 2015 Long Wan. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.