Deakin University
Browse

File(s) under permanent embargo

Pareto archived simulated annealing for single machine job shop scheduling with multiple objectives

conference contribution
posted on 2011-01-01, 00:00 authored by Samer HanounSamer Hanoun, Saeid Nahavandi, H Kull
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.

History

Event

International Multi-Conference on Computing in the Global Information Technology (6th : 2011 : Luxembourg City, Luxembourg)

Pagination

99 - 104

Publisher

[IARIA]

Location

Luxembourg City, Luxembourg

Place of publication

[Luxembourg City, Luxembourg]

Start date

2011-06-19

End date

2011-06-24

ISBN-13

9781612081397

Language

eng

Publication classification

E1 Full written paper - refereed

Copyright notice

2011, IARIA

Editor/Contributor(s)

C Paleologu, C Mavromoustakis, M Minea

Title of proceedings

ICCGI 2011 : Sixth International Multi-Conference on Computing in the Global Information Technology