Lorenz versus Pareto dominance in a single machine scheduling problem with rejection

Authors:
Atefeh Moghaddam;Farouk Yalaoui;Lionel Amodeo
Affiliations:
ICD, LOSI, University of Technology of Troyes, Troyes, France;ICD, LOSI, University of Technology of Troyes, Troyes, France;ICD, LOSI, University of Technology of Troyes, Troyes, France
Venue:
EMO'11 Proceedings of the 6th international conference on Evolutionary multi-criterion optimization
Year:
2011

Citing 9
Cited 0

Multiprocessor Scheduling with Rejection

SIAM Journal on Discrete Mathematics
Preemptive multiprocessor scheduling with rejection

Theoretical Computer Science
Online scheduling with machine cost and rejection

Discrete Applied Mathematics
Note: The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan

Theoretical Computer Science
Bounded single-machine parallel-batch scheduling with release dates and rejection

Computers and Operations Research
A PTAS for parallel batch scheduling with rejection and dynamic job arrivals

Theoretical Computer Science
A simulated annealing approach to a bi-criteria sequencing problem in a two-stage supply chain

Computers and Industrial Engineering
Infinite order Lorenz dominance for fair multiagent optimization

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Performance assessment of multiobjective optimizers: an analysis and review

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

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 Paretodominance 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.