In this paper, a rescheduling strategy based Genetic Algorithm and Tabu search is introduced to solve the dynamic job shop scheduling problem where the objective is to minimize the makespan ( C max ). To evaluate the adopted methodology, numerical experiments have been designed to test the performance of the proposal. Yet, we have compared the obtained results with some common dispatching rules and meta-heuristic algorithm. Our proposal gives significant results in terms of minimum completion time(makespan).
No takes yet. Share an insight, caveat, or question.
Ali et al. (2019) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: