On the exact solution of a large class of parallel machine scheduling problems
| hal.structure.identifier | Universidade Federal da Paraiba / Federal University of Paraiba [UFPB] | |
| dc.contributor.author | BULHOES, Teobaldo | |
| hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
| dc.contributor.author | SADYKOV, Ruslan | |
| hal.structure.identifier | Universidade Federal da Paraiba / Federal University of Paraiba [UFPB] | |
| dc.contributor.author | SUBRAMANIAN, Anand | |
| hal.structure.identifier | Universidade Federal Fluminense [Rio de Janeiro] [UFF] | |
| dc.contributor.author | UCHOA, Eduardo | |
| dc.date.accessioned | 2024-04-04T03:03:02Z | |
| dc.date.available | 2024-04-04T03:03:02Z | |
| dc.date.created | 2020 | |
| dc.date.issued | 2020 | |
| dc.identifier.issn | 1094-6136 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/193040 | |
| dc.description.abstractEn | This work deals with a very generic class of scheduling problems with identical/uniform/unrelated parallel machine environment. It considers well-known attributes such as release dates or sequence-dependent setup times and accepts any objective function defined over job completion times. Non-regular objectives are also supported. We introduce a branch-cut-and-price algorithm for such problems that makes use of non-robust cuts, i.e., cuts which change the structure of the pricing problem. This is the first time that such cuts are employed for machine scheduling problems. The algorithm also embeds other important techniques such as strong branching, reduced cost fixing and dual stabilization. Computational experiments over literature benchmarks showed that the proposed algorithm is indeed effective and could solve many instances to optimality for the first time. | |
| dc.language.iso | en | |
| dc.publisher | Springer Verlag | |
| dc.subject.en | Parallel machines | |
| dc.subject.en | Unified algorithm | |
| dc.subject.en | Branch-cut-and-price | |
| dc.title.en | On the exact solution of a large class of parallel machine scheduling problems | |
| dc.type | Article de revue | |
| dc.identifier.doi | 10.1007/s10951-020-00640-z | |
| dc.subject.hal | Informatique [cs]/Recherche opérationnelle [cs.RO] | |
| bordeaux.journal | Journal of Scheduling | |
| bordeaux.page | 411-429 | |
| bordeaux.volume | 23 | |
| bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.type.institution | Universidade Federal Fluminense | |
| bordeaux.peerReviewed | oui | |
| bordeaux.type.report | rr | |
| hal.identifier | hal-01958180 | |
| hal.version | 1 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-01958180v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Journal%20of%20Scheduling&rft.date=2020&rft.volume=23&rft.spage=411-429&rft.epage=411-429&rft.eissn=1094-6136&rft.issn=1094-6136&rft.au=BULHOES,%20Teobaldo&SADYKOV,%20Ruslan&SUBRAMANIAN,%20Anand&UCHOA,%20Eduardo&rft.genre=article |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||