Efficient meta-heuristics based on various dominance criteria for a single-machine bi-criteria scheduling problem with rejection
| Autor: | Farouk Yalaoui, Atefeh Moghaddam, Lionel Amodeo |
|---|---|
| Přispěvatelé: | Laboratoire d'Optimisation des Systèmes Industriels (LOSI), Institut Charles Delaunay (ICD), Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS)-Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS), National Iranian Oil Refining & Distribution Company (NIORDC), Siemens Industry Software SAS (Chatillon) |
| Jazyk: | angličtina |
| Rok vydání: | 2015 |
| Předmět: |
Rate-monotonic scheduling
Mathematical optimization Single-machine scheduling Job shop scheduling Scheduling (production processes) Dynamic priority scheduling [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO] Lorenz dominance Industrial and Manufacturing Engineering Fair-share scheduling Hardware and Architecture Control and Systems Engineering Nurse scheduling problem Scheduling Multiple-criteria decision making Pareto dominance Single machine Metaheuristic Self-control dominance Software Mathematics |
| Zdroj: | Journal of Manufacturing Systems Journal of Manufacturing Systems, 2015, 34, pp.12-22. ⟨10.1016/j.jmsy.2014.09.006⟩ Journal of Manufacturing Systems, Elsevier, 2015, 34, pp.12-22. ⟨10.1016/j.jmsy.2014.09.006⟩ |
| ISSN: | 0278-6125 |
| Popis: | International audience; 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect