Energetic Reasoning and Bin-Packing Problem for bounding a parallel machine problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue 4OR: A Quarterly Journal of Operations Research Année : 2006

Energetic Reasoning and Bin-Packing Problem for bounding a parallel machine problem

Résumé

This paper deals with an extension of energetic reasoning, using some efficient lower bounds of the bin-packing problem, to get tight lower bounds for the P|r i , q i |C max. The link between P||C max and bin-packing problem is well-known. Our purpose is to extend the use of efficient lower bounds of the bin-packing problem to P|r i , q i |C max. We focus on some time-intervals, to compute the mandatory parts of activities within this time-interval and then to deduce an associated bin-packing instance. Thus, lower bounds of the bin-packing problem are used to get new satisfiability tests for the parallel machine problem. We also propose to extend the classical time-bound adjustments of release dates and deadlines to efficiently use bin-packing lower bounds. Experimental results that prove the efficiency of our approach on several kind of instances are reported.
Fichier non déposé

Dates et versions

hal-01022101 , version 1 (10-07-2014)

Identifiants

  • HAL Id : hal-01022101 , version 1

Citer

Fabrice Tercinet, Emmanuel Neron, Christophe Lenté. Energetic Reasoning and Bin-Packing Problem for bounding a parallel machine problem. 4OR: A Quarterly Journal of Operations Research, 2006, 4 (4), pp.297-317. ⟨hal-01022101⟩
18 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More