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.

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

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Wen-Chiung Lee ◽  
Yau-Ren Shiau ◽  
Yu-Hsiang Chung ◽  
Lawson Ding
Keyword(s):  
Simulated Annealing ◽  
Branch And Bound ◽  
Single Machine ◽  
Completion Time ◽  
Heuristic Algorithms ◽  
Single Machine Scheduling ◽  
Total Completion Time ◽  
Optimal Sequence ◽  
Tardy Jobs ◽  
Annealing Algorithms

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.

scholarly journals Competitive Two-Agent Scheduling with Learning Effect and Release Times on a Single Machine

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Der-Chiang Li ◽  
Peng-Hsiang Hsu
Keyword(s):  
Single Machine ◽  
Learning Effect ◽  
Optimal Solution ◽  
Total Weighted Completion Time ◽  
Optimal Solutions ◽  
Release Times ◽  
Agent Scheduling ◽  
Weighted Completion Time ◽  
Dominance Properties ◽  
Annealing Algorithms

The learning effect has gained much attention in the scheduling research recently, where many researchers have focused their problems on only one optimization. This study further addresses the scheduling problem in which two agents compete to perform their own jobs with release times on a common single machine with learning effect. The aim is to minimize the total weighted completion time of the first agent, subject to an upper bound on the maximum lateness of the second agent. We propose a branch-and-bound approach with several useful dominance properties and an effective lower bound for searching the optimal solution and three simulated-annealing algorithms for the near-optimal solutions. The computational results show that the proposed algorithms perform effectively and efficiently.

scholarly journals A Batching Machine Model for Lot Scheduling on a Single Machine

2018 ◽  
Vol 43 (1) ◽  
pp. 37-40
Author(s):  
Mikhail Y. Kovalyov
Keyword(s):  
Single Machine ◽  
Completion Time ◽  
Optimal Solution ◽  
Time Algorithm ◽  
Machine Model ◽  
Average Completion Time ◽  
Lot Scheduling ◽  
Batching Machine ◽  
Machine Problem ◽  
Total Average

Abstract A recently introduced lot scheduling problem is considered. It is to find a partition of jobs of n orders into lots and to sequence these lots on a single machine so that the total average completion time of the orders is minimized. A simple O(n log n) time algorithm is presented for this problem in the literature, with a relatively sophisticated proof of its optimality. We show that modeling this problem as a classic batching machine problem makes its optimal solution obvious.

Sign in / Sign up

Export Citation Format

Share Document