Impact of sequence-dependent setup time on job shop scheduling performance

1994 ◽  
Vol 32 (7) ◽  
pp. 1503-1520 ◽  
Author(s):  
S. C. KIM ◽  
P. M. BOBROWSKI
Author(s):  
Toru Eguchi ◽  
Katsutoshi Nishi ◽  
Hiroaki Kawai ◽  
Takeshi Murayama

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.


2011 ◽  
Vol 339 ◽  
pp. 332-335 ◽  
Author(s):  
Parinya Kaweegitbundit

This paper considers flow shop scheduling problems with sequence dependent setup time. The makespan criterion has been considered. In this paper presented a comparison of three heuristics for solves this problem. The memetic algorithm, genetic algorithm and NEH heuristic have been compared. In the experimental, the result from memetic algorithm is maximum the best solution. Therefore, the MA heuristic outperforms other heuristic.


Sign in / Sign up

Export Citation Format

Share Document