Minimizing the total weighted completion time in the relocation problem (Q964872): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10951-009-0151-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1983299988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relocation problems are hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling subject to resource constraints: Classification and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource-constrained project scheduling: Notation, classification, models, and methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast feasibility test for relocation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On relocation problems with multiple identical working crews / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight complexity analysis of the relocation problem with arbitrary release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for single machine scheduling problems with financial constraints / rank
 
Normal rank

Latest revision as of 17:42, 2 July 2024

scientific article
Language Label Description Also known as
English
Minimizing the total weighted completion time in the relocation problem
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references