Skip to Main content Skip to Navigation
Conference papers

Lower Bounds for Tardiness Minimization on a Single Machine with Family Setup Times

Abstract : In this paper, we consider the scheduling of N jobs on a single machine with family setup times in order to minimize the total tardiness. The set of jobs is divided into F families. Between two jobs of the same family, we have not to stop the machine. However, when switching from family to another, a setup is required. Each family is characterized by a setup time independent of the sequence. We propose a set of approaches to compute lower bounds for the tardiness criterion. These approaches are analyzed and tested on a large set of numerical experiments in order to identify the dominant lower bounds
Document type :
Conference papers
Complete list of metadatas

https://hal-utt.archives-ouvertes.fr/hal-02496064
Contributor : Daniel Gavrysiak <>
Submitted on : Monday, March 2, 2020 - 4:53:47 PM
Last modification on : Tuesday, March 3, 2020 - 1:36:14 AM

Identifiers

Collections

ROSAS | UTT | CNRS

Citation

Imed Kacem. Lower Bounds for Tardiness Minimization on a Single Machine with Family Setup Times. Multiconference on "Computational Engineering in Systems Applications, Oct 2006, Beijing, China. pp.1034-1039, ⟨10.1109/CESA.2006.4281799⟩. ⟨hal-02496064⟩

Share

Metrics

Record views

44