An exact algorithm for the bi-objective timing problem

Laetitia Jourdan 1, 2 Sophie Jacquin 1 Fanny Dufossé 2, 3
2 ORKAD - Operational Research, Knowledge And Data
CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
3 DATAMOVE - Data Aware Large Scale Computing
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : 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.
Type de document :
Article dans une revue
Optimization Letters, Springer Verlag, 2018, 12 (4), pp.903-914. 〈10.1007/s11590-018-1237-y〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01716581
Contributeur : Laetitia Jourdan <>
Soumis le : vendredi 23 février 2018 - 18:40:50
Dernière modification le : jeudi 8 novembre 2018 - 14:26:11

Identifiants

Citation

Laetitia Jourdan, Sophie Jacquin, Fanny Dufossé. An exact algorithm for the bi-objective timing problem. Optimization Letters, Springer Verlag, 2018, 12 (4), pp.903-914. 〈10.1007/s11590-018-1237-y〉. 〈hal-01716581〉

Partager

Métriques

Consultations de la notice

515