Efficient meta-heuristics based on various dominance criteria for a single-machine bi-criteria scheduling problem with rejection - Archive ouverte HAL Access content directly
Journal Articles Journal of Manufacturing Systems Year : 2015

Efficient meta-heuristics based on various dominance criteria for a single-machine bi-criteria scheduling problem with rejection

(1, 2, 3) , (1) , (1)
1
2
3

Abstract

In this paper, we try to fill in the gap between theory and practice in production scheduling by defining a new term as “rejection” and treating the corresponding scheduling problem with multi-objective optimization approach. We study a bi-objective single machine scheduling problem with rejection. At the beginning of scheduling time horizon, scheduler needs to decide which job shall be rejected due to the resource constraints regarding two objective functions: minimization of total weighted completion time of accepted jobs and total rejection penalty of rejected jobs. We develop different algorithms to find the best estimation of Pareto-optimal front for this problem. In order to improve the quality of the solutions, on the one hand, and facilitate the process of selecting best solution for the final decision maker, on the other hand, we integrate various dominance criteria into our proposed algorithms. Finally we compare the performance of those methods by testing on a large set of instances and highlight the advantages and weak points of each one.
Not file

Dates and versions

hal-02493355 , version 1 (27-02-2020)

Identifiers

Cite

Atefeh Moghaddam, Farouk Yalaoui, Lionel Amodeo. Efficient meta-heuristics based on various dominance criteria for a single-machine bi-criteria scheduling problem with rejection. Journal of Manufacturing Systems, 2015, 34, pp.12-22. ⟨10.1016/j.jmsy.2014.09.006⟩. ⟨hal-02493355⟩

Collections

CNRS UTT LOSI
10 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More