An exact algorithm for the bi-objective timing problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Optimization Letters Année : 2018

An exact algorithm for the bi-objective timing problem

Résumé

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.
Fichier principal
Vignette du fichier
Jacquin2018.pdf (116.67 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01716581 , version 1 (23-11-2022)

Licence

Paternité - Pas d'utilisation commerciale

Identifiants

Citer

Sophie Jacquin, Fanny Dufossé, Laetitia Jourdan. An exact algorithm for the bi-objective timing problem. Optimization Letters, 2018, 12 (4), pp.903-914. ⟨10.1007/s11590-018-1237-y⟩. ⟨hal-01716581⟩
460 Consultations
47 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More