The two-machine flowshop total completion time problem: A branch-and-bound based on Network-flow formulation
| hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
| hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
| dc.contributor.author | DETIENNE, Boris | |
| hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
| dc.contributor.author | SADYKOV, Ruslan | |
| hal.structure.identifier | Institute for Liberal Arts and Sciences [Kyoto] | |
| dc.contributor.author | TANAKA, Shunji | |
| dc.date.accessioned | 2024-04-04T03:16:36Z | |
| dc.date.available | 2024-04-04T03:16:36Z | |
| dc.date.issued | 2015-08 | |
| dc.date.conference | 2015-08 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/194228 | |
| dc.description.abstractEn | We consider the flowshop problem on two machines with sequence-independent setup times to minimize total completion time. Large scale network flow formulations of the problem are suggested together with strong Lagrangian bounds based on these formulations. To cope with their size, filtering procedures are developed. To solve the problem to optimality, we embed the Lagrangian bounds into two branch-and- bound algorithms. The best algorithm is able to solve all 100-jobs instances of our testbed with and without setup times, thus significantly outperforming the best algorithms in the literature. | |
| dc.language.iso | en | |
| dc.subject.en | Scheduling | |
| dc.subject.en | Flowshop | |
| dc.subject.en | Branch-and-bound | |
| dc.subject.en | Lagrangean relaxation | |
| dc.title.en | The two-machine flowshop total completion time problem: A branch-and-bound based on Network-flow formulation | |
| dc.type | Communication dans un congrès | |
| dc.subject.hal | Informatique [cs]/Recherche opérationnelle [cs.RO] | |
| bordeaux.page | 635-637 | |
| 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.conference.title | 7th Multidisciplinary International Conference on Scheduling: Theory and Applications | |
| bordeaux.country | CZ | |
| bordeaux.conference.city | Prague | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-01248318 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | oui | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-01248318v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2015-08&rft.spage=635-637&rft.epage=635-637&rft.au=DETIENNE,%20Boris&SADYKOV,%20Ruslan&TANAKA,%20Shunji&rft.genre=unknown |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||