Veuillez utiliser cette adresse pour citer ce document :
http://dspace1.univ-tlemcen.dz/handle/112/1733| Titre: | A Branch and Bound Algorithm to Minimize Makespan on Identical Parallel Machines with Consumable Resources |
| Auteur(s): | BELKAID, Fayçal MALIKI, Fouad BOUDAHRI, Fethi SARI, Zaki |
| Mots-clés: | Scheduling Makespan Parallel Machines Branch and Bound |
| Date de publication: | 2012 |
| Résumé: | In this paper, we study a scheduling problem for minimizing the makespan on identical parallel machines with consumable resources in a node of a supply chain. The goal is to provide a first exact approach to this problem through the use of Branch and Bound method. We propose two new heuristics and apply other with a series of lower bounds that are incorporated into our algorithm. We tested a large number of randomly generated instances that allow us to compare the computation time and quality of lower bounds and heuristics. |
| URI/URL: | http://dspace.univ-tlemcen.dz/handle/112/1733 |
| Collection(s) : | Articles internationaux |
Fichier(s) constituant ce document :
| Fichier | Description | Taille | Format | |
|---|---|---|---|---|
| A-Branch-and-Bound-Algorithm-to-Minimize-Makespan.pdf | 26,73 kB | Adobe PDF | Voir/Ouvrir |
Tous les documents dans DSpace sont protégés par copyright, avec tous droits réservés.