A branch and bound approach for earliness-tardiness scheduling problems with different due dates - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1995

A branch and bound approach for earliness-tardiness scheduling problems with different due dates

Abstract

The problem of scheduling n jobs on a single machine in order to minimize the weighted sum of earliness and tardiness in NP-complete when jobs have different due dates. In most of the papers dedicated to this problem, authors assume that there is no idle time between two consecutive jobs. However, as indicated by several authors, this assumption is not consistent with the earliness-tardiness criterion. It is the reason why we do not make this assumption in this paper. To reach an optimal solution, we propose a branch-and-bound approach which takes advantage of some dominance properties and lower bounding procedures. Numerical experiments show that the algorithm can solve this problem with up to twenty jobs in a reasonable amont of time.
Fichier principal
Vignette du fichier
RR-2495.pdf (896.87 Ko) Télécharger le fichier

Dates and versions

inria-00074180 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00074180 , version 1

Cite

Haoxun Chen, Chengbin Chu, Jean-Marie Proth. A branch and bound approach for earliness-tardiness scheduling problems with different due dates. [Research Report] RR-2495, INRIA. 1995, pp.19. ⟨inria-00074180⟩
97 View
39 Download

Share

Gmail Facebook X LinkedIn More