Case study on statistically estimating minimum makespan for flow line scheduling problems.

DOI10.1016/S0377-2217(02)00910-4zbMath1043.90035OpenAlexW2053856949MaRDI QIDQ1427564

Russell E. King, Amy D. Wilson, James R. Wilson

Publication date: 14 March 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00910-4

zbMATH Keywords

HeuristicsSchedulingConfidence-interval estimationFlexible flow line

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90)

Related Items (3)

On statistical bounds of heuristic solutions to location problems ⋮ Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem ⋮ Confidence in heuristic solutions?

Cites Work

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

This page was built for publication: Case study on statistically estimating minimum makespan for flow line scheduling problems.