Case study on statistically estimating minimum makespan for flow line scheduling problems. (Q1427564): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A stochastic method for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical inference for bounds of random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Confidence Limits for the Global Optimum in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval estimation of a global optimum for large combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic solutions and confidence intervals for the multicovering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3259350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Stage, Hybrid Flowshop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a two-stage hybrid flow shop with parallel machines at the first stage / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic for the n-job, M-machine flow-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Revised Simplex Search Procedure for Stochastic Simulation Response Surface Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremes and related properties of random sequences and processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Search Model for Evaluating Combinatorially Explosive Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nelder-Mead Simplex Procedure for Function Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating interval estimates of global optima and local search methods for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of a truncation point / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some efficient heuristic methods for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient heuristic for large set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulation study of some simple estimators for the three-parameter weibull distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge / rank
 
Normal rank

Latest revision as of 15:29, 6 June 2024

scientific article
Language Label Description Also known as
English
Case study on statistically estimating minimum makespan for flow line scheduling problems.
scientific article

    Statements

    Case study on statistically estimating minimum makespan for flow line scheduling problems. (English)
    0 references
    0 references
    0 references
    0 references
    14 March 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    Heuristics
    0 references
    Scheduling
    0 references
    Confidence-interval estimation
    0 references
    Flexible flow line
    0 references
    0 references