Modified cuckoo optimization algorithm (MCOA) t solve precedence constrained sequencing problem (PCSP).

摘要

The precedence constrained sequencing problem (PCSP) is a general problem: Consider a set of jobs where an arbitrary precedence relationship exists among the jobs and a cost is associated with every permutation of the jobs. The objective is to find a minimum-cost permutation which is consistent with the precedence relations. One of the earliest works in this field is by Monma. It is one of the many problems "related to locating the optimal sequence with the shortest traveling time among all feasible sequences." Maadi et al. go on define the problem's motivation: "applications in network[ing], scheduling, project management, logistics, assembly flow, and routing." Due to its various practical applications, PCSP is considered "a useful tool for a variety of industrial planning and scheduling problems." As the authors explain, "new metaheuris-tic algorithms have been developed to solve optimization problems," for example, Rajabioun's cuckoo optimization algorithm (COA).