scholarly journals Note—On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure

1984 ◽  
Vol 30 (5) ◽  
pp. 644-647 ◽  
Author(s):  
Sushil K. Gupta ◽  
Tapan Sen
Keyword(s):  
Single Machine ◽  
Penalty Function ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problem ◽  
Completion Times ◽  
Quadratic Penalty Function

scholarly journals Hybridization Simulated Annealing Algorithm in a Single Machine Scheduling Problem

2021 ◽  
Vol 20 ◽  
pp. 597-605
Author(s):  
Hafed M. Motair
Keyword(s):  
Simulated Annealing ◽  
Single Machine ◽  
Simulated Annealing Algorithm ◽  
Optimal Solution ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problem ◽  
Metaheuristic Algorithm ◽  
Annealing Algorithm ◽  
Completion Times

In this paper, we investigate a single machine scheduling problem (SMSP). We try to reach the optimal or near optimal solution which minimize the sum of three objective functions: total completion times, total tardiness and total earliness. Firstly, we solve this problem by Branch and bound algorithm (BAB alg) to find optimal solutions, dominance rules (DR)s are used to improve the performance of BAB alg, the resulting is BABDR, secondly, we solve this problem by simulated annealing algorithm (SA alg) as metaheuristic algorithm (MET alg). It is known that combining MET alg with other algorithms can improve the resulting solutions. In this paper we developed the concept of insertion preselected jobs one by one through all positions of remaining jobs of considered sequence, the proposed MET alg called Insertion Metaheuristic Algorithm (IMA). This procedure improves the performance of SA alg in two directions: in the first one, we use the IMA to generate initial solution for SA alg, in the second one, we use the IMA to improve the solution obtained through the iterations of SA alg. The experiments showed that IMA can improve the performance of SA alg in these two directions.

scholarly journals AN EXACT APPROACH FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLY AND QUADRATIC TARDY PENALTIES

2008 ◽  
Vol 25 (02) ◽  
pp. 169-186 ◽  
Author(s):  
JORGE M. S. VALENTE
Keyword(s):  
Branch And Bound ◽  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problem ◽  
Dominance Test ◽  
Branch And Bound Algorithms ◽  
Exact Approach ◽  
Lower Bounding ◽  
Completion Times

In this paper, we consider the single machine scheduling problem with linear earliness and quadratic tardiness costs, and no machine idle time. We propose a lower bounding procedure based on the relaxation of the jobs' completion times. Optimal branch-and-bound algorithms are then presented. These algorithms incorporate the proposed lower bound, as well as an insertion-based dominance test. The branch-and-bound procedures are tested on a wide set of randomly generated problems. The computational results show that the branch-and-bound algorithms are capable of optimally solving, within reasonable computation times, instances with up to 20 jobs.

A two-agent single-machine scheduling problem to minimize the total cost with release dates

2015 ◽  
Vol 21 (3) ◽  
pp. 805-816 ◽  
Author(s):  
Du-Juan Wang ◽  
Yunqiang Yin ◽  
Wen-Hsiang Wu ◽  
Wen-Hung Wu ◽  
Chin-Chia Wu ◽  
...  
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Release Dates ◽  
Scheduling Problem ◽  
Total Cost
Sign in / Sign up

Export Citation Format

Share Document