A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties (Q2563872): 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.1016/0305-0548(95)00084-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011818161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Bound Strategies for Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—Operations Sequencing in Discrete Parts Manufacturing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic heuristic for a computationally difficult set covering problem / rank
 
Normal rank

Latest revision as of 09:58, 27 May 2024

scientific article
Language Label Description Also known as
English
A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties
scientific article

    Statements

    A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties (English)
    0 references
    0 references
    0 references
    0 references
    10 April 1997
    0 references
    0 references
    greedy randomized adaptive search procedure
    0 references
    single machine scheduling
    0 references
    sequence dependent setup costs
    0 references
    linear delay penalties
    0 references
    0 references