Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm
From MaRDI portal
Publication:2289017
DOI10.1016/j.artint.2019.103173zbMath1478.90040OpenAlexW2972393264MaRDI QIDQ2289017
Günther R. Raidl, Matthias Horn, Christian Blum
Publication date: 20 January 2020
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10261/197461
Deterministic scheduling theory in operations research (90B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
\( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan
- A survey of variants and extensions of the resource-constrained project scheduling problem
- Optimization models for radiotherapy patient scheduling
- 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
- Job shop scheduling with beam search
- Potential-based bounded-cost search and anytime non-parametric A*
- Anytime pack search
- Solving RCPSP/max by lazy clause generation
- Heuristic search viewed as path finding in a graph
- Generalized best-first search strategies and the optimality of A*
- The Three-Machine No-Wait Flow Shop is NP-Complete
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Particle therapy patient scheduling with limited starting time variations of daily treatments
