\(\mathrm{A}^\ast\) search for prize-collecting job sequencing with one common and multiple secondary resources
From MaRDI portal
Publication:2241156
DOI10.1007/s10479-020-03550-7zbMath1480.90133OpenAlexW3009123347MaRDI QIDQ2241156
Elina Rönnberg, Günther R. Raidl, Matthias Horn
Publication date: 8 November 2021
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-020-03550-7
Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items (2)
New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources ⋮ Strengthening of feasibility cuts in logic-based benders decomposition
Cites Work
- Orienteering problem: a survey of recent variants, solution approaches and applications
- A survey of variants and extensions of the resource-constrained project scheduling problem
- Sequencing jobs that require common resources on a single machine: A solvable case of the TSP
- A survey of scheduling problems with no-wait in process
- \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem
- Anytime pack search
- An optimisation approach for pre-runtime scheduling of tasks and communication in an integrated modular avionic system
- The Three-Machine No-Wait Flow Shop is NP-Complete
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: \(\mathrm{A}^\ast\) search for prize-collecting job sequencing with one common and multiple secondary resources