Maximizing the minimum completion time on parallel machines
| dc.citation.epage | 392 | en_US |
| dc.citation.issueNumber | 4 | en_US |
| dc.citation.spage | 375 | en_US |
| dc.citation.volumeNumber | 6 | en_US |
| dc.contributor.author | Haouari, M. | en_US |
| dc.contributor.author | Jemmali, M. | en_US |
| dc.date.accessioned | 2016-02-08T10:06:33Z | |
| dc.date.available | 2016-02-08T10:06:33Z | |
| dc.date.issued | 2008 | en_US |
| dc.department | Department of Management | en_US |
| dc.description.abstract | We propose an exact branch-and-bound algorithm for the problem of maximizing the minimum machine completion time on identical parallel machines. The proposed algorithm is based on tight lower and upper bounds as well as an effective symmetry-breaking branching strategy. Computational results performed on a large set of randomly generated instances attest to the efficacy of the proposed algorithm. | en_US |
| dc.description.provenance | Made available in DSpace on 2016-02-08T10:06:33Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2008 | en |
| dc.identifier.doi | 10.1007/s10288-007-0053-5 | en_US |
| dc.identifier.issn | 1619-4500 | |
| dc.identifier.uri | http://hdl.handle.net/11693/22923 | |
| dc.language.iso | English | en_US |
| dc.publisher | Springer | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1007/s10288-007-0053-5 | en_US |
| dc.source.title | 4OR | en_US |
| dc.subject | Branch-and-bound | en_US |
| dc.subject | Identical parallel machines | en_US |
| dc.subject | Scheduling | en_US |
| dc.title | Maximizing the minimum completion time on parallel machines | en_US |
| dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Maximizing the minimum completion time on parallel machines.pdf
- Size:
- 182 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version