Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 596306, 9 pages
Research Article

Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents

1Department of Statistics, Feng Chia University, Taichung, Taiwan
2Department of Industrial Engineering and System Management, Feng Chia University, Taichung, Taiwan
3Department of Industrial & Engineering Management, National Chiao Tung University, Hsinchu, Taiwan

Received 25 November 2013; Accepted 12 December 2013; Published 19 January 2014

Academic Editors: F. R. B. Cruz and A. Sedeño-noda

Copyright © 2014 Wen-Chiung Lee et al. 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.


We consider a single-machine two-agent problem where the objective is to minimize a weighted combination of the total completion time and the total tardiness of jobs from the first agent given that no tardy jobs are allowed for the second agent. A branch-and-bound algorithm is developed to derive the optimal sequence and two simulated annealing heuristic algorithms are proposed to search for the near-optimal solutions. Computational experiments are also conducted to evaluate the proposed branch-and-bound and simulated annealing algorithms.