Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm
- 558 Downloads
Most flexible job shop scheduling models assume that the machines are available all of the time. However, in most realistic situations, machines may be unavailable due to maintenances, pre-schedules and so on. In this paper, we study the flexible job shop scheduling problem with availability constraints. The availability constraints are non-fixed in that the completion time of the maintenance tasks is not fixed and has to be determined during the scheduling procedure. We then propose a hybrid genetic algorithm to solve the flexible job shop scheduling problem with non-fixed availability constraints (fJSP-nfa). The genetic algorithm uses an innovative representation method and applies genetic operations in phenotype space in order to enhance the inheritability. We also define two kinds of neighbourhood for the problem based on the concept of critical path. A local search procedure is then integrated under the framework of the genetic algorithm. Representative flexible job shop scheduling benchmark problems and fJSP-nfa problems are solved in order to test the effectiveness and efficiency of the suggested methodology.
KeywordsFlexible job shop scheduling Availability constraints Genetic algorithm Local search Critical path Maintenance scheduling
Unable to display preview. Download preview PDF.
- Balas, E., Vazacopoulos, A. 1998Guided local search with shifting bottleneck for job shop schedulingManagement Science44262275Google Scholar
- Gen, M., Cheng, R. 1997Genetic algorithms & engineering designWileyNew YorkGoogle Scholar
- Gen, M., Cheng, R. 2000Genetic algorithms & engineering optimizationWileyNew YorkGoogle Scholar
- Krasnogor, N., & Smith, J. (2000). A memetic algorithm with self-adaptive local search: TSP as a case study. Proceedings of 2000 genetic and evolutionary computation conference, July 10–12, Las Vegas, NV, pp. 987–994.Google Scholar
- Moscato, P., & Norman, M. (1992). A memetic approach for the traveling salesman problem: implementation of a computational ecology for combinatorial optimization on message-passing systems. Proceedings of the international conference on parallel computing and transputer applications, Amsterdam.Google Scholar
- Pinedo, M. 2002Scheduling theory, algorithms and systemsPrentice-HallUpper Saddle River, NJGoogle Scholar
- Zhang, H., Gen, M. 2005Multistage-based genetic algorithm for flexible job-shop scheduling problemJournal of Complexity International11223232Google Scholar