Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups (Q2468493): 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 / OpenAlex ID
 
Property / OpenAlex ID: W2168623380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3212909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-time scheduling of an automated manufacturing center / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs on parallel machines with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with batching: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4826104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job shop scheduling with beam search / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Single Machine Early/Tardy Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bounds for the early/tardy scheduling problem with no idle time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recovering beam search algorithm for the single machine just-in-time scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Algorithm for the Total Weighted Tardiness Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing stochastic search performance by value-biased randomization of heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups / rank
 
Normal rank

Latest revision as of 15:52, 27 June 2024

scientific article
Language Label Description Also known as
English
Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups
scientific article

    Statements

    Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups (English)
    0 references
    0 references
    0 references
    23 January 2008
    0 references
    0 references
    scheduling
    0 references
    weighted tardiness
    0 references
    sequence-dependent setups
    0 references
    beam search
    0 references
    0 references