Minimizing grid capacity in preemptive electric vehicle charging orchestration: complexity, exact and heuristic approaches

DOI10.1016/J.EJOR.2023.05.039OpenAlexW4379115174MaRDI QIDQ6069212

No author found.

Publication date: 14 November 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2023.05.039

zbMATH Keywords

complexityschedulingpreemptioniterated local searchelectric vehicle charging

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• An improved annealing scheme for the QAP
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• A hybrid exact method for a scheduling problem with a continuous resource and energy constraints
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• A survey of variants and extensions of the resource-constrained project scheduling problem
• Scheduling subject to resource constraints: Classification and complexity
• Convergence of an annealing algorithm

This page was built for publication: Minimizing grid capacity in preemptive electric vehicle charging orchestration: complexity, exact and heuristic approaches