ThinkMind // ICCGI 2011, The Sixth International Multi-Conference on Computing in the Global Information Technology // View article iccgi_2011_5_30_10098
Pareto Archived Simulated Annealing for Single Machine Job Shop Scheduling with Multiple Objectives
Keywords: Multi-criteria optimization; Simulated annealing; Metaheuristic procedures; Pareto optimal; Job shop scheduling.
In this paper, the single machine job shop scheduling problem is studied with the objectives of minimizing the tardiness and the material cost of jobs. The simultaneous consideration of these objectives is the multi-criteria optimization problem under study. A metaheuristic procedure based on simulated annealing is proposed to find the approximate Pareto optimal (non-dominated) solutions. The two objectives are combined in one composite utility function based on the decision maker's interest in having a schedule with weighted combination. In view of the unknown nature of the weights for the defined objectives, a priori approach is applied to search for the non-dominated set of solutions based on the Pareto dominance. The obtained solutions set is presented to the decision maker to choose the best solution according to his preferences. The performance of the algorithm is evaluated in terms of the number of non-dominated schedules generated and the proximity of the obtained non-dominated front to the true Pareto front. Results show that the produced solutions do not differ significantly from the optimal solutions.
Pages: 99 to 104
Copyright: Copyright (c) IARIA, 2011
Publication date: June 19, 2011
Published in: conference
Location: Luxembourg City, Luxembourg
Dates: from June 19, 2011 to June 24, 2011