\(\mathrm{A}^\ast\) search for prize-collecting job sequencing with one common and multiple secondary resources (Q2241156): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10479-020-03550-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3009123347 / rank
 
Normal rank
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: An optimisation approach for pre-runtime scheduling of tasks and communication in an integrated modular avionic system / 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: Orienteering problem: a survey of recent variants, solution approaches and applications / 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: \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / 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: 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

Latest revision as of 02:39, 27 July 2024

scientific article
Language Label Description Also known as
English
\(\mathrm{A}^\ast\) search for prize-collecting job sequencing with one common and multiple secondary resources
scientific article

    Statements

    \(\mathrm{A}^\ast\) search for prize-collecting job sequencing with one common and multiple secondary resources (English)
    0 references
    0 references
    0 references
    0 references
    8 November 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    sequencing
    0 references
    \(\mathrm{A}^\ast\) algorithm
    0 references
    particle therapy patient scheduling
    0 references
    0 references