A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs

2011 ◽  
Vol 38 (9) ◽  
pp. 1361-1365 ◽  
Author(s):  
M. Duran Toksarı
Keyword(s):  
Branch And Bound ◽  
Single Machine ◽  
Learning Effect ◽  
Deteriorating Jobs ◽  
Branch And Bound Algorithm ◽  
Release Times

scholarly journals Note on a Single-Machine Scheduling Problem with Sum of Processing Times Based Learning and Ready Times

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Shang-Chia Liu ◽  
Wei-Ling Hung ◽  
Chin-Chia Wu
Keyword(s):  
Branch And Bound ◽  
Heuristic Algorithm ◽  
Single Machine ◽  
Learning Effect ◽  
Optimal Solution ◽  
Single Machine Scheduling ◽  
Branch And Bound Algorithm ◽  
Release Time ◽  
Average Error ◽  
Processing Times

In the recent 20 years, scheduling with learning effect has received considerable attention. However, considering the learning effect along with release time is limited. In light of these observations, in this paper, we investigate a single-machine problem with sum of processing times based learning and ready times where the objective is to minimize the makespan. For solving this problem, we build a branch-and-bound algorithm and a heuristic algorithm for the optimal solution and near-optimal solution, respectively. The computational experiments indicate that the branch-and-bound algorithm can perform well the problem instances up to 24 jobs in terms of CPU time and node numbers, and the average error percentage of the proposed heuristic algorithm is less than 0.5%.

Scheduling deteriorating jobs on a single machine with release times

2008 ◽  
Vol 54 (3) ◽  
pp. 441-452 ◽  
Author(s):  
Wen-Chiung Lee ◽  
Chin-Chia Wu ◽  
Yu-Hsiang Chung
Keyword(s):  
Single Machine ◽  
Deteriorating Jobs ◽  
Release Times
Sign in / Sign up

Export Citation Format

Share Document