A study of the single-machine two-agent scheduling problem with release times |
| |
Authors: | Chin-Chia Wu Wen-Hung Wu Juei-Chao Chen Yunqiang Yin Wen-Hsiang Wu |
| |
Affiliation: | 1. Department of Statistics, Feng Chia University, Taichung, Taiwan;2. Department of Business Administration, Kang-Ning Junior College, Taipei, Taiwan;3. Department of Statistics and Information Science & Graduate Institute of Applied Statistics, Fu-Jen Catholic University, Taipei County, Taiwan;4. School of Mathematics and Information Sciences, East China Institute of Technology, Fuzhou, Jiangxi 344000, China;5. Department of Healthcare Management, Yuanpei University, Hsinchu, Taiwan |
| |
Abstract: | In many management situations, multiple agents compete on the usage of common processing resources. On the other hand, the importance of the ready times can be shown in Wafer fabrication with the presence of unequal ready times. It is sometimes advantageous to form a non-full batch, while in other situations it is a better strategy to wait for future job arrivals in order to increase the fullness of the batch. However, research on scheduling with two-agent and ready time simultaneously is relatively unexplored. This paper addresses a single-machine two-agent scheduling problem with ready times. The aim is to find an optimal schedule to minimize the total completion time of the jobs of the first agent with the restriction that total completion time is allowed an upper bound for the second agent. To the best of our knowledge, the problem under study has not been considered. Firstly, we show that the proposed problem is strongly NP-hard. Following that, we then develop a branch-and-bound, an ant colony, and four genetic algorithms for an optimal and near-optimal solution, respectively. In addition, the extensive computational experiments are also given. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|