Lorenz versus Pareto Dominance in a Single Machine Scheduling Problem with Rejection - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

Lorenz versus Pareto Dominance in a Single Machine Scheduling Problem with Rejection

(1) , (1) , (1)
1

Abstract

Scheduling problems have been studied from many years ago. Most of the papers which were published in this domain are different in one or many of issues as following: objective functions, machine environment, constraints and methodology for solving the problems. In this paper we address the problem of single machine scheduling in which due to some constraints like capacity, rejection of a set of jobs is accepted. The problem is considered as bi-objective one: minimization of the sum of weighted completion times for the accepted jobs and minimization of the sum of penalties for the rejected jobs. We find that in this problem, the solutions are not handled in a satisfactory way by general Pareto-dominance rule, so we suggest the application of Lorenz-dominance to an adapted bi-objective simulated annealing algorithm. Finally we justify the use of Lorenz-dominance as a useful refinement of Pareto-dominance by comparing the results.

Dates and versions

hal-02552235 , version 1 (23-04-2020)

Identifiers

Cite

Atefeh Moghaddam, Farouk Yalaoui, Lionel Amodeo. Lorenz versus Pareto Dominance in a Single Machine Scheduling Problem with Rejection. Sixth International Conference on Evolutionary Multi-Criterion Optimization (EMO 2011), Apr 2011, Ouro Preto, Brazil. pp.520-534, ⟨10.1007/978-3-642-19893-9_36⟩. ⟨hal-02552235⟩

Collections

CNRS UTT LOSI
10 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More