Modeling of flexible job shop scheduling problems and its solution by using evolutionary algorithms

摘要

In this paper, we consider an extended type of flexible job shop scheduling problems. First, we formalize this type of problems as an mixed-integer programming problem. Then, we newly construct a solution method by adopting genetic algorithms based on the formula. Through some computational experiments, the effectiveness and the possibility of the proposed method are examined.