Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops (Q857354): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measures of subproblem criticality in decomposition algorithms for shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of shifting bottleneck procedures for shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition methods for reentrant flow shops with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling unrelated parallel machines to minimize total weighted tardiness. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4238569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with batching: A review / rank
 
Normal rank

Latest revision as of 11:41, 25 June 2024

scientific article
Language Label Description Also known as
English
Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
scientific article

    Statements

    Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 December 2006
    0 references
    0 references
    scheduling
    0 references
    genetic algorithms
    0 references
    complex job shops
    0 references
    shifting bottleneck heuristic
    0 references
    0 references
    0 references
    0 references