Job Shop Scheduling to Meet Due Dates With Consideration to Sequence Dependent Setup Times in a Dynamic Environment
Keyword(s):
Job Shop
◽
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.
2009 ◽
Vol 47
(18)
◽
pp. 5217-5236
◽
2005 ◽
Vol 30
(1-2)
◽
pp. 105-111
◽
2012 ◽
Vol 2012
(0)
◽
pp. _S142013-1-_S142013-5
A genetic algorithm for a re-entrant job-shop scheduling problem with sequence-dependent setup times
2009 ◽
Vol 41
(6)
◽
pp. 505-520
◽
2015 ◽
Vol 5
(1)
◽
pp. 19
◽