Integrated hub location and flow processing schedule problem under renewable capacity constraint
From MaRDI portal
Publication:2244988
DOI10.1007/s40314-021-01548-wzbMath1476.90056OpenAlexW3172863303MaRDI QIDQ2244988
Publication date: 12 November 2021
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-021-01548-w
heuristic algorithmmixed-integer linear programmingtotal tardinesshub locationLagrangian relaxation algorithmflow processing schedule
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Multi-product capacitated single-allocation hub location problems: formulations and inequalities
- Integrated strategic and tactical planning in a supply chain network design with a heuristic solution method
- Hub location for time definite transportation
- A quadratic integer program for the location of interacting hub facilities
- Lagrangean relaxation. (With comments and rejoinder).
- Perspectives on modeling hub location problems
- A bi-objective incomplete hub location-routing problem with flow shipment scheduling
- Network hub location problems: The state of the art
- Capacitated single allocation hub location problem-A bi-criteria approach
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
