Timing problems and algorithms: Time decisions for sequences of activities
From MaRDI portal
Publication:4642457
DOI10.1002/net.21587zbMath1390.90486OpenAlexW2074413296MaRDI QIDQ4642457
Michel Gendreau, Christian Prins, Thibaut Vidal, Teodor Gabriel Crainic
Publication date: 23 May 2018
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21587
optimizationschedulingbranch and boundresource allocationstatistical inferencetimingroutingneighborhood search
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items
Scheduling activities with time-dependent durations and resource consumptions, An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP, A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience, Bi-objective orienteering for personal activity scheduling, Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows, A concise guide to existing and emerging vehicle routing problem variants, The vehicle routing problem with arrival time diversification on a multigraph, Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems, Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining, Graph representation of the fixed route dial-a-ride problem, A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management, The Vehicle Routing Problem with Release and Due Dates, Heuristics for vehicle routing problems: sequence or set optimization?, Minimizing the maximal ergonomic burden in intra-hospital patient transportation, Routing a mix of conventional, plug-in hybrid, and electric vehicles, The job shop scheduling problem with convex costs, Industrial and tramp ship routing problems: closing the gap for real-scale instances, A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
