Pages that link to "Item:Q1977991"

The following pages link to Efficient algorithms for buffer space allocation (Q1977991):

Displaying 34 items.

• Two approaches for solving the buffer allocation problem in unreliable production lines (Q336569) (← links)
• Hybrid approach for buffer allocation in open serial production lines (Q337559) (← links)
• A parallel tabu search for solving the primal buffer allocation problem in serial production systems (Q342074) (← links)
• Complexity of buffer capacity allocation problems for production lines with unreliable machines (Q367250) (← links)
• Discrete time model for two-machine one-buffer transfer lines with restart policy (Q383142) (← links)
• Approximating the buffer allocation problem using epochs (Q436884) (← links)
• The two-machine one-buffer continuous time model with restart policy (Q499297) (← links)
• Lean buffering in serial production lines with Bernoulli machines (Q610121) (← links)
• SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications (Q743971) (← links)
• Buffer allocation in stochastic flow lines via sample-based optimization with initial bounds (Q747748) (← links)
• Efficient combined immune-decomposition algorithm for optimal buffer allocation in production lines for throughput and profit maximization (Q1040957) (← links)
• Modeling of throughput in production lines using response surface methodology and artificial neural networks (Q1646435) (← links)
• An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines (Q1762138) (← links)
• Mathematical programming formulations for approximate simulation of multistage production systems (Q1926696) (← links)
• Multi-fidelity surrogate-based optimization for decomposed buffer allocation problems (Q2241996) (← links)
• The time buffer approximated buffer allocation problem: a row-column generation approach (Q2289911) (← links)
• Analysis of assembly/disassembly queueing networks with blocking after service and general service times (Q2341225) (← links)
• Using linear programming to analyze and optimize stochastic flow lines (Q2430644) (← links)
• Bus and buffer usage in in-home digital networks: applying the dantzig-wolfe decomposition (Q2464411) (← links)
• Optimal buffer allocation in finite closed networks with multiple servers (Q2471231) (← links)
• Application of the cross-entropy method to the buffer allocation problem in a simulation-based environment (Q2485930) (← links)
• A continuous buffer allocation model using stochastic processes (Q2630233) (← links)
• Network flow based buffer planning (Q2778432) (← links)
• A new method for the placement of buffers in serial production lines (Q3055341) (← links)
• Selecting machines and buffers in unreliable series-parallel production lines (Q3055372) (← links)
• Robustness of state-dependent queues and material handling systems (Q3163368) (← links)
• Analysis of serial production lines: characterisation study and a new heuristic procedure for optimal buffer allocation (Q3439873) (← links)
• Buffer and server allocation in general multi-server queueing networks (Q3563626) (← links)
• Buffer capacity for accommodating machine downtime in serial production lines (Q4674450) (← links)
• Joint optimization of maintenance, buffers and machines in manufacturing lines (Q5058696) (← links)
• Buffered Resource Constraint: Algorithms and Complexity (Q5418740) (← links)
• Production control and combined discrete/continuous simulation modeling in failure-prone transfer lines (Q5451187) (← links)
• (Q5719013) (← links)
• A fast staffing algorithm for multistage call centers with impatient customers and time-dependent overflow (Q6608513) (← links)