Minimizing resource consumption on uniform parallel machines with a bound on makespan (Q336672): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A state-of-the-art review of parallel-machine scheduling research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4546261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling identical parallel machines and operators within a period based changing mode / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified LPT algorithm for the two uniform parallel machine makespan minimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with machine availability and eligibility constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated greedy local search methods for unrelated parallel machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplified swarm optimization in disassembly sequencing problems with learning effects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the stochastic dynamic lot-sizing problem through nature-inspired heuristics / rank
 
Normal rank

Revision as of 21:42, 12 July 2024

scientific article
Language Label Description Also known as
English
Minimizing resource consumption on uniform parallel machines with a bound on makespan
scientific article

    Statements

    Identifiers