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 |
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)
-
Manual and robotic storage and picking systems : a literature review
Silva, Allyson, (2024)
- More ...