Multi-objective decision making and search space for the evaluation of production process scheduling

Multi-objective decision making and search space for the evaluation of production process schedulingOver the years, various approaches have been proposed in order to solve the multi-objective job-shop scheduling problem - particularly a hard combinatorial optimization problem. The paper presents an evaluation of job shop scheduling problem under multiple objectives (mean flow time, max lateness, mean tardiness, mean weighted tardiness, mean earliness, mean weighted earliness, number of tardy tasks). The formulation of the scheduling problem has been presented as well as the evaluation schedules for various optimality criteria. The paper describes the basic mataheuristics used for optimization schedules and the approaches that use domination method, fuzzy method, and analytic hierarchy proccess (AHP) for comparing schedules in accordance with multiple objectives. The effectiveness of the algorithms has been tested on several examples and the results have been shown. New search space for evaluation and generation of schedules has been created. The three-dimensional space can be used for the analysis and control of the production processes.