New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources
From MaRDI portal
Publication:2106718
DOI10.1016/j.ejor.2022.07.012OpenAlexW3184138719MaRDI QIDQ2106718
Aurélien Froger, Ruslan Sadykov
Publication date: 19 December 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.07.012
Cites Work
- The third comprehensive survey on scheduling problems with setup times/costs
- Orienteering problem: a survey of recent variants, solution approaches and applications
- The orienteering problem: a survey
- Iterated local search for the team orienteering problem with time windows
- Sequencing jobs that require common resources on a single machine: A solvable case of the TSP
- \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem
- Solving bin packing problems using VRPSolver models
- \(\mathrm{A}^\ast\) search for prize-collecting job sequencing with one common and multiple secondary resources
- Improved branch-cut-and-price for capacitated vehicle routing
- Single-machine scheduling problems with past-sequence-dependent setup times
- Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- Particle therapy patient scheduling with limited starting time variations of daily treatments
This page was built for publication: New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources
