A Branch and Bound Algorithm to Minimize Makespan on Identical Parallel Machines with Consumable Resources
| dc.contributor.author | Belkaid, Fayçal | en_US |
| dc.contributor.author | Maliki, Fouad | en_US |
| dc.contributor.author | Boudahri, Fethi | en_US |
| dc.contributor.author | Sari, Zaki | en_US |
| dc.date.accessioned | 2013-04-10T10:04:18Z | en_US |
| dc.date.available | 2013-04-10T10:04:18Z | en_US |
| dc.date.issued | 2012 | en_US |
| dc.description.abstract | 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. | en_US |
| dc.identifier.other | doi:10.1007/978-3-642-31507-7_36 | en_US |
| dc.identifier.uri | https://dspace.univ-tlemcen.dz/handle/112/1733 | en_US |
| dc.language.iso | en | en_US |
| dc.subject | Scheduling | en_US |
| dc.subject | Makespan | en_US |
| dc.subject | Parallel Machines | en_US |
| dc.subject | Branch and Bound | en_US |
| dc.title | A Branch and Bound Algorithm to Minimize Makespan on Identical Parallel Machines with Consumable Resources | en_US |
| dc.type | Article | en_US |