An Iterated Local Search heuristic for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times

2014 ◽  
Vol 52 (9) ◽  
pp. 2729-2742 ◽  
Author(s):  
Anand Subramanian ◽  
Maria Battarra ◽  
Chris N. Potts
Keyword(s):  
Local Search ◽  
Iterated Local Search ◽  
Setup Times ◽  
Total Weighted Tardiness ◽  
Scheduling Problem ◽  
Weighted Tardiness ◽  
Local Search Heuristic ◽  
Sequence Dependent Setup ◽  
Dependent Setup Times ◽  
Sequence Dependent Setup Times

Solving parallel machine scheduling problem with release dates using genetic algorithm

2018 ◽  
Vol 7 (2.29) ◽  
pp. 91
Author(s):  
Yasothei Suppiah ◽  
Ajitha Angusamy ◽  
Goh Wei Wei ◽  
Noradzilah Bt Ismail
Keyword(s):  
Genetic Algorithm ◽  
Setup Times ◽  
Total Weighted Tardiness ◽  
Release Dates ◽  
Scheduling Problem ◽  
Weighted Tardiness ◽  
Research Questions ◽  
Sequence Dependent Setup ◽  
Dependent Setup Times ◽  
Sequence Dependent Setup Times

This research deals with a scheduling problem for parallel machines environment to minimize total weighted tardiness with the consideration of sequence dependent setup times and release dates. There are two research questions that need to be addressed: 1) How to allocate jobs on machines ?  2) How to sequence jobs on each machine? Therefore, this research aims to find an efficient solution method that answers the research questions with the goal of minimizing the total weighted tardiness with the presence of sequence dependent setup times. Due to the complexity of the problem at hand, the authors have developed genetic algorithm to find a solution to this problem. Furthermore, various dispatching rules were used to enhance the performance of the genetic algorithm in terms of the total weighted tardiness value. 

Sign in / Sign up

Export Citation Format

Share Document