A hybrid heuristic approach for single machine scheduling with release times - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Computers and Operations Research Année : 2014

A hybrid heuristic approach for single machine scheduling with release times

Résumé

In this work we consider the well-known one-machine total completion time sequencing problem subject to release times. We present a very large scale neighborhood search heuristic based on mathematical programming. This heuristic makes use of the positional completion time formulation of the problem in which valid inequalities are added. The proposed procedure compares favorably with the state of the art heuristics
Fichier non déposé

Dates et versions

hal-01003993 , version 1 (11-06-2014)

Identifiants

Citer

Federico Della Croce, Vincent t'Kindt, Fabio Salassa. A hybrid heuristic approach for single machine scheduling with release times. Computers and Operations Research, 2014, 45, pp.7-11. ⟨10.1016/j.cor.2013.11.016⟩. ⟨hal-01003993⟩
34 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More