Loading...
Please wait, while we are loading the content...
A Branch and Bound Algorithm to Minimize Makespan on Identical Parallel Machines with Consumable Resources
| Content Provider | Semantic Scholar |
|---|---|
| Author | Belkaid, Fayçal Maliki, Fouad Boudahri, Fethi Sari, Zaki |
| Copyright Year | 2012 |
| 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. |
| Starting Page | 217 |
| Ending Page | 221 |
| Page Count | 5 |
| File Format | PDF HTM / HTML |
| DOI | 10.1007/978-3-642-31507-7_36 |
| Alternate Webpage(s) | http://dspace.univ-tlemcen.dz/bitstream/112/1733/3/A-Branch-and-Bound-Algorithm-to-Minimize-Makespan.pdf |
| Alternate Webpage(s) | https://page-one.springer.com/pdf/preview/10.1007/978-3-642-31507-7_36 |
| Alternate Webpage(s) | https://doi.org/10.1007/978-3-642-31507-7_36 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
