On the Tardiness Minimization on Single Machine - Université de Lorraine Access content directly
Conference Papers Year : 2021

On the Tardiness Minimization on Single Machine

Abstract

In this paper, we describe a Branch-and-Bound (B&B) approach for the problem of minimizing the total tardiness of a set of jobs on a single machine. This is an important objective in several applications where a payment is required in the case of delayed jobs. A new lower bound has been introduced based on several heuristics for the problem. An experimental campaign has been performed showing that our approach can handle up to 20 jobs in a reasonable time.
No file

Dates and versions

hal-03999943 , version 1 (22-02-2023)

Identifiers

Cite

Bochra Djahel, Imed Kacem, Giorgio Lucarelli. On the Tardiness Minimization on Single Machine. 2021 IEEE International Conference on Networking, Sensing and Control (ICNSC), Dec 2021, Xiamen, China. pp.1-6, ⟨10.1109/ICNSC52481.2021.9702231⟩. ⟨hal-03999943⟩
22 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More