About this Journal Submit a Manuscript Table of Contents
Mathematical Problems in Engineering
Volume 2013 (2013), Article ID 805261, 5 pages
http://dx.doi.org/10.1155/2013/805261
Research Article

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

School of Management, Shenyang University of Technology, Shenyang 110870, China

Received 22 May 2013; Revised 15 July 2013; Accepted 15 July 2013

Academic Editor: Yunqiang Yin

Copyright © 2013 Peng Liu and Xiaoyu Tian. 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.

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.