Evaluating artificial intelligence heuristics for a flexible Kanban system: simultaneous Kanban controlling and scheduling

摘要

This paper evaluates several artificial intelligence heuristics for a simultaneous Kanban controlling and scheduling on a flexible Kanban system. The objective of the problem is to minimise a total production cost that includes due date penalty, inventory, and machining costs. We show that the simultaneous Kanban controlling and scheduling is critical in minimising the total production cost (approximately 30% cost reduction over scheduling without a Kanban controlling). To identify the most effective search method for the simultaneous Kanban controlling and scheduling, we evaluated widely known artificial intelligence heuristics: genetic algorithm, simulated annealing, tabu search, and neighbourhood search. Computational results show that the tabu search performs the best in terms of solution quality. The tabu search also requires a much less computational time than the genetic algorithm and the simulated annealing. To further improve the solution quality and computational time for a simultaneous Kanban controlling and scheduling on a flexible Kanban system, we developed a two-stage tabu search. At the beginning of the tabu search process, an initial solution is constructed by utilising the customer due date information given by a decision support system. The two-stage tabu search performs better than the tabu search with a randomly generated initial solution in both the solution quality and computational time across all problem sizes. The difference in the solution quality is more pronounced at the early stages of the search.