An exact algorithm for the bi-objective ...
Type de document :
Article dans une revue scientifique: Article original
Titre :
An exact algorithm for the bi-objective timing problem
Auteur(s) :
Jacquin, Sophie [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Dufossé, Fanny [Auteur]
Data Aware Large Scale Computing [DATAMOVE ]
Operational Research, Knowledge And Data [ORKAD]
Jourdan, Laetitia [Auteur]
Operational Research, Knowledge And Data [ORKAD]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Dufossé, Fanny [Auteur]
Data Aware Large Scale Computing [DATAMOVE ]
Operational Research, Knowledge And Data [ORKAD]
Jourdan, Laetitia [Auteur]

Operational Research, Knowledge And Data [ORKAD]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Titre de la revue :
Optimization Letters
Pagination :
903–914
Éditeur :
Springer Verlag
Date de publication :
2018-02-01
ISSN :
1862-4472
Mot(s)-clé(s) en anglais :
Timing problem
Exact algorithm
Just-in-time scheduling
Bi-objective
Exact algorithm
Just-in-time scheduling
Bi-objective
Discipline(s) HAL :
Computer Science [cs]/Operations Research [math.OC]
Résumé en anglais : [en]
The timing problem in the bi-objective just-in-time single-machine job-shop scheduling problem (JiT-JSP) is the task to schedule N jobs whose order is fixed, with each job incurring a linear earliness penalty for finishing ...
Lire la suite >The timing problem in the bi-objective just-in-time single-machine job-shop scheduling problem (JiT-JSP) is the task to schedule N jobs whose order is fixed, with each job incurring a linear earliness penalty for finishing ahead of its due date and a linear tardiness penalty for finishing after its due date. The goal is to minimize the earliness and tardiness simultaneously. We propose an exact greedy algorithm that finds the entire Pareto front in O(N2) time. This algorithm is asymptotically optimal.Lire moins >
Lire la suite >The timing problem in the bi-objective just-in-time single-machine job-shop scheduling problem (JiT-JSP) is the task to schedule N jobs whose order is fixed, with each job incurring a linear earliness penalty for finishing ahead of its due date and a linear tardiness penalty for finishing after its due date. The goal is to minimize the earliness and tardiness simultaneously. We propose an exact greedy algorithm that finds the entire Pareto front in O(N2) time. This algorithm is asymptotically optimal.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :
Fichiers
- document
- Accès libre
- Accéder au document
- Jacquin2018.pdf
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- Jacquin2018.pdf
- Accès libre
- Accéder au document