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

A Single-Machine Two-Agent Scheduling Problem by a Branch-and-Bound and Three Simulated Annealing Algorithms

1Business Administration Department, Fu Jen Catholic University, New Taipei City 24205, Taiwan
2Department of Healthcare Management, Yuanpei University, Hsinchu 30015, Taiwan
3Department of Business Administration and Graduate Institute of Management, Providence University, Shalu, Taichung 43301, Taiwan
4Department of Statistics, Feng Chia University, Taichung 40724, Taiwan
5Business College, Beijing Union University, Beijing 100101, China

Received 30 June 2014; Accepted 11 August 2014

Academic Editor: Chin-Chia Wu

Copyright © 2015 Shangchia Liu 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.


In the field of distributed decision making, different agents share a common processing resource, and each agent wants to minimize a cost function depending on its jobs only. These issues arise in different application contexts, including real-time systems, integrated service networks, industrial districts, and telecommunication systems. Motivated by its importance on practical applications, we consider two-agent scheduling on a single machine where the objective is to minimize the total completion time of the jobs of the first agent with the restriction that an upper bound is allowed the total completion time of the jobs for the second agent. For solving the proposed problem, a branch-and-bound and three simulated annealing algorithms are developed for the optimal solution, respectively. In addition, the extensive computational experiments are also conducted to test the performance of the algorithms.