A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts
Year of publication: |
2021
|
---|---|
Authors: | Bianchessi, Nicola ; Tresoldi, Emanuele |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 136.2021, p. 1-13
|
Subject: | Agreement graph | Branch-and-price | Conflict graph | Identical parallel machine | Scheduling | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Graphentheorie | Graph theory | Branch-and-Bound | Branch and Bound |
-
Approximation algorithms for job scheduling with block-type conflict graphs
FurmaĆczyk, Hanna, (2024)
-
Two-machine flow shop problem with unit-time operations and conflict graph
Tellache, Nour El Houda, (2017)
-
A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
Kowalczyk, Daniel, (2018)
- More ...
-
A personalized walking bus service requiring optimized route decisions : a real case
Tresoldi, Emanuele, (2021)
-
Archetti, Claudia, (2014)
-
Formulations for an inventory routing problem
Archetti, Claudia, (2014)
- More ...