Table 2 Categorization and post-processing strategy of a RVT.

From: An enhanced walrus optimization algorithm for flexible job shop scheduling with parallel batch processing operation

  1. B and C represent the values of PBPOs. A is the value of either a job predecessor, successor of B, or the middle task between A and B. N denotes the number of jobs.
Back to article page