A Single-Machine Two-Agent Scheduling Problem by a Branch-and-Bound and Three Simulated Annealing Algorithms
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 di...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2015-01-01
|
| Series: | Discrete Dynamics in Nature and Society |
| Online Access: | http://dx.doi.org/10.1155/2015/681854 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850232088129699840 |
|---|---|
| author | Shangchia Liu Wen-Hsiang Wu Chao-Chung Kang Win-Chin Lin Zhenmin Cheng |
| author_facet | Shangchia Liu Wen-Hsiang Wu Chao-Chung Kang Win-Chin Lin Zhenmin Cheng |
| author_sort | Shangchia Liu |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-040f2cf7b28b43599af5d8fbdf15e57a |
| institution | OA Journals |
| issn | 1026-0226 1607-887X |
| language | English |
| publishDate | 2015-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Discrete Dynamics in Nature and Society |
| spelling | doaj-art-040f2cf7b28b43599af5d8fbdf15e57a2025-08-20T02:03:18ZengWileyDiscrete Dynamics in Nature and Society1026-02261607-887X2015-01-01201510.1155/2015/681854681854A Single-Machine Two-Agent Scheduling Problem by a Branch-and-Bound and Three Simulated Annealing AlgorithmsShangchia Liu0Wen-Hsiang Wu1Chao-Chung Kang2Win-Chin Lin3Zhenmin Cheng4Business Administration Department, Fu Jen Catholic University, New Taipei City 24205, TaiwanDepartment of Healthcare Management, Yuanpei University, Hsinchu 30015, TaiwanDepartment of Business Administration and Graduate Institute of Management, Providence University, Shalu, Taichung 43301, TaiwanDepartment of Statistics, Feng Chia University, Taichung 40724, TaiwanBusiness College, Beijing Union University, Beijing 100101, ChinaIn 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.http://dx.doi.org/10.1155/2015/681854 |
| spellingShingle | Shangchia Liu Wen-Hsiang Wu Chao-Chung Kang Win-Chin Lin Zhenmin Cheng A Single-Machine Two-Agent Scheduling Problem by a Branch-and-Bound and Three Simulated Annealing Algorithms Discrete Dynamics in Nature and Society |
| title | A Single-Machine Two-Agent Scheduling Problem by a Branch-and-Bound and Three Simulated Annealing Algorithms |
| title_full | A Single-Machine Two-Agent Scheduling Problem by a Branch-and-Bound and Three Simulated Annealing Algorithms |
| title_fullStr | A Single-Machine Two-Agent Scheduling Problem by a Branch-and-Bound and Three Simulated Annealing Algorithms |
| title_full_unstemmed | A Single-Machine Two-Agent Scheduling Problem by a Branch-and-Bound and Three Simulated Annealing Algorithms |
| title_short | A Single-Machine Two-Agent Scheduling Problem by a Branch-and-Bound and Three Simulated Annealing Algorithms |
| title_sort | single machine two agent scheduling problem by a branch and bound and three simulated annealing algorithms |
| url | http://dx.doi.org/10.1155/2015/681854 |
| work_keys_str_mv | AT shangchialiu asinglemachinetwoagentschedulingproblembyabranchandboundandthreesimulatedannealingalgorithms AT wenhsiangwu asinglemachinetwoagentschedulingproblembyabranchandboundandthreesimulatedannealingalgorithms AT chaochungkang asinglemachinetwoagentschedulingproblembyabranchandboundandthreesimulatedannealingalgorithms AT winchinlin asinglemachinetwoagentschedulingproblembyabranchandboundandthreesimulatedannealingalgorithms AT zhenmincheng asinglemachinetwoagentschedulingproblembyabranchandboundandthreesimulatedannealingalgorithms AT shangchialiu singlemachinetwoagentschedulingproblembyabranchandboundandthreesimulatedannealingalgorithms AT wenhsiangwu singlemachinetwoagentschedulingproblembyabranchandboundandthreesimulatedannealingalgorithms AT chaochungkang singlemachinetwoagentschedulingproblembyabranchandboundandthreesimulatedannealingalgorithms AT winchinlin singlemachinetwoagentschedulingproblembyabranchandboundandthreesimulatedannealingalgorithms AT zhenmincheng singlemachinetwoagentschedulingproblembyabranchandboundandthreesimulatedannealingalgorithms |