scholarly journals Scheduling Jobs on a Single Machine With Dirt Cleaning Consideration to Minimize Total Completion Time

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 22290-22300 ◽  
Author(s):  
Yarong Chen ◽  
Ling-Huey Su ◽  
Ya-Chih Tsai ◽  
Shenquan Huang ◽  
Fuh-Der Chou
Keyword(s):  
Single Machine ◽  
Completion Time ◽  
Total Completion Time

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

2015 ◽  
Vol 2015 ◽  
pp. 1-8 ◽  
Author(s):  
Shangchia Liu ◽  
Wen-Hsiang Wu ◽  
Chao-Chung Kang ◽  
Win-Chin Lin ◽  
Zhenmin Cheng
Keyword(s):  
Simulated Annealing ◽  
Branch And Bound ◽  
Single Machine ◽  
Completion Time ◽  
Optimal Solution ◽  
Total Completion Time ◽  
Practical Applications ◽  
Processing Resource ◽  
Agent Scheduling ◽  
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 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.

Sign in / Sign up

Export Citation Format

Share Document