Meta-RaPS for a bi-objective unrelated parallel machine scheduling problem

Abstract

This chapter discusses the capability and effectiveness of a Metahheuristic for Randomized Priority Search to solve multi-objective problems. The multi-objective problem of unrelated parallel machine scheduling is considered in the chapter. The two objectives to minimize are total weighted tardiness and total weighted completion time. An existing construction rule in the literature named Apparent Tardiness Cost-bi heuristic is used as the basis for the meta-heuristic construction phase to generate non-dominated solutions. The computational results obtained are promising when results of the meta-heuristic approach proposed are compared with those of the original construction rule. This chapter illustrates that the meta-heuristic approach proposed is effective and flexible enough to generate Pareto-frontiers in order to solve multi-objective scheduling problems by modifying a simple existing heuristic found in the literature.