Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm (Q2289017): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A survey of scheduling problems with no-wait in process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization models for radiotherapy patient scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized best-first search strategies and the optimality of A* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of variants and extensions of the resource-constrained project scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Particle therapy patient scheduling with limited starting time variations of daily treatments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic search viewed as path finding in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Three-Machine No-Wait Flow Shop is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job shop scheduling with beam search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving RCPSP/max by lazy clause generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential-based bounded-cost search and anytime non-parametric A* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anytime pack search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing jobs that require common resources on a single machine: A solvable case of the TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan / rank
 
Normal rank

Latest revision as of 11:49, 21 July 2024

scientific article
Language Label Description Also known as
English
Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm
scientific article

    Statements

    Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm (English)
    0 references
    0 references
    0 references
    0 references
    20 January 2020
    0 references
    sequencing
    0 references
    scheduling
    0 references
    A* algorithm
    0 references
    beam search
    0 references
    particle therapy patient scheduling
    0 references

    Identifiers