New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources

DOI10.1016/J.EJOR.2022.07.012MaRDI QIDQ2106718zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

schedulingiterated local searchsequencingbranch-cut-and-pricelabeling algorithm

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• \(\mathrm{A}^\ast\) search for prize-collecting job sequencing with one common and multiple secondary resources
• Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm
• A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times
• Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times
• Optimal interval scheduling with a resource constraint

Cites work

• Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
• Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
• Improved branch-cut-and-price for capacitated vehicle routing
• Iterated local search for the team orienteering problem with time windows
• New enhancements for the exact solution of the vehicle routing problem with time windows
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• Orienteering problem: a survey of recent variants, solution approaches and applications
• Particle therapy patient scheduling with limited starting time variations of daily treatments
• Path-reduced costs for eliminating arcs in routing and scheduling
• Sequencing jobs that require common resources on a single machine: A solvable case of the TSP
• Single-machine scheduling problems with past-sequence-dependent setup times
• Solving bin packing problems using VRPSolver models
• The orienteering problem: a survey
• The third comprehensive survey on scheduling problems with setup times/costs
• \(\mathrm{A}^*\)-based construction of decision diagrams for a prize-collecting scheduling problem
• \(\mathrm{A}^\ast\) search for prize-collecting job sequencing with one common and multiple secondary resources

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106718)