A new approach for multi-criteria scheduling

• We use a Enhanced SA algorithm for bi-criteria permutation flow shop problem.
• We consider vector processing to improve computational time of the algorithm.
• Implementation of VESA is achieved even on single thread processors.
• Considerable increase in number of evaluated solutions per unit of time is observed.
• Better approximation of the Pareto frontier is obtained.

In this paper we propose a new approach, recommended for solving certain class of multi-criteria scheduling problems, with the use of cloud exploration of the solution space supported by fine-grained parallel computing. The approach allow us to approximate Pareto front more accurately than other known algorithms in competitive time. To show and check advantageous properties of the proposed approach, the new solution algorithm, called VESA, was implemented for the case of bi-criteria flow shop scheduling problem and tested against a number of high-quality benchmarks known in the literature. Vector processing technologies are used to enhance the efficiency of solution search and acceptance rates for the extended simulated annealing metaheuristic. Results are compared using, among others, the independent Hyper-Volume Indicator (IH)(IH) measure. Computer test of VESA confirms excellent approximation of the Pareto front.

Figure optionsDownload as PowerPoint slide