Solving Flexible Job-shop Problem with Sequence-dependent Setup Times by Using Selection Hyper-heuristics

2020 ◽  
Author(s):  
Min Luo ◽  
Jian Lin ◽  
Li Xu
Keyword(s):  
Job Shop ◽  
Setup Times ◽  
Flexible Job Shop ◽  
Sequence Dependent ◽  
Sequence Dependent Setup ◽  
Dependent Setup Times ◽  
Sequence Dependent Setup Times ◽  
Flexible Job Shop Problem

Job Shop Scheduling to Meet Due Dates With Consideration to Sequence Dependent Setup Times in a Dynamic Environment

2012 ◽  
Author(s):  
Toru Eguchi ◽  
Katsutoshi Nishi ◽  
Hiroaki Kawai ◽  
Takeshi Murayama
Keyword(s):  
Genetic Algorithm ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Dynamic Environment ◽  
Setup Times ◽  
Shop Scheduling ◽  
Sequence Dependent ◽  
Sequence Dependent Setup ◽  
Dependent Setup Times ◽  
Sequence Dependent Setup Times

In this paper, we propose a dynamic job shop scheduling method to minimize tardiness with consideration to sequence dependent setup times. Schedules are optimized on a rolling basis using the mixture of genetic algorithm and switching priority rules. Both in genetic algorithm and switching rules, schedules are generated to increase due date allowances to be robust in dynamic environment. Numerical experiments show the effectiveness of the proposed method.

Sign in / Sign up

Export Citation Format

Share Document