In this paper a new approach is presented to solve multi-objective production scheduling and rescheduling problems. Furthermore the relationship between production goals and heuristic solving methods in an extended flexible flow shop environment is also investigated. We define production goals by specifying objective functions and apply special production constraints for the extended flow shop scheduling model. We focus on creating near-optimal feasible schedule considering multiple objectives. The proposed method is based on the well-known tabu search meta-heuristic. Moreover we use an advanced structure of the tabu list, new relational and neighbourhood operators for multi-objective aim. At the end we present some computational experiments on small and large size problem instances.
scheduling, rescheduling, multi-objective optimization, tabu search, extended flexible flow shop
