A relax-and-restrict matheuristic for supply chain network design with facility location and customer due date flexibility
| Year of publication: |
2024
|
|---|---|
| Authors: | Kidd, Martin ; Darvish, Maryam ; Coelho, Leandro C. ; Gendron, Bernard |
| Published in: |
Transportation research : an international journal. - Oxford : Pergamon, Elsevier Science, ISSN 1878-5794, ZDB-ID 2013782-5. - Vol. 182.2024, Art.-No. 103370, p. 1-17
|
| Subject: | Decomposition algorithm | Delivery due date | Distribution | Flexibility | Location decisions | Lieferkette | Supply chain | Betriebliche Standortwahl | Firm location choice | Algorithmus | Algorithm | Dekompositionsverfahren | Decomposition method | Theorie | Theory | Standortwahl | Location choice | Scheduling-Verfahren | Scheduling problem | Flexibles Fertigungssystem | Flexible manufacturing system |
-
An iterative decomposition algorithm for flexible two-echelon network design
Kidd, Martin, (2021)
-
Tapia-Ubeda, Francisco J., (2018)
-
Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem
Juvin, Carla, (2023)
- More ...
-
An iterative decomposition algorithm for flexible two-echelon network design
Kidd, Martin, (2021)
-
Integrated production-distribution systems: trends and perspectives
Darvish, Maryam, (2021)
-
Delivering in congested urban environments: the benefits of several depots and a diverse fleet
Schmidt, Carise E., (2022)
- More ...