An approximate/exact objective based search technique for solving general scheduling problems
Andrzej Kozik , Radosław Rudek
AbstractIn this paper, we analyze single machine scheduling problems under the following minimization objectives: the maximum completion time (makespan), the total completion time and the maximum lateness, including fundamental practical aspects, which often occur in industrial or manufacturing reality: release dates, due dates, setup times, precedence constraints, deterioration (aging) of machines, as well as maintenance activities. To solve the problems, we propose an efficient representation of a solution and a fast neighborhood search technique, which calculates an approximation of criterion values in a constant time per solution in a neighborhood. On this basis, a novel approximate/exact search technique, using exact as well as approximate criterion values during search process, is introduced and used to develop efficient metaheuristic algorithms dedicated to the considered problems. Their efficiency is verified during computational experiments
|Journal series||Applied Soft Computing, ISSN 1568-4946, (A 40 pkt)|
|Publication size in sheets||0.55|
|Keywords in English||Scheduling, Precedence constraints, Setup time, Maintenance activity, Aging effect, Metaheuristic|
|Publication indicators||= 0; : 2016 = 2.037; : 2017 = 3.907 (2) - 2017=4.004 (5)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.