Determining buffer location and size in production lines using tabu search
From MaRDI portal
(Redirected from Publication:1609894)
Recommendations
- An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines
- Two approaches for solving the buffer allocation problem in unreliable production lines
- A parallel tabu search for solving the primal buffer allocation problem in serial production systems
- A new method for the placement of buffers in serial production lines
- A simulated annealing approach for buffer allocation in reliable production lines
Cites work
- scientific article; zbMATH DE number 3666517 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- A tabu search heuristic procedure for solving the transportation problem with exclusionary side constraints
- A tabu search heuristic procedure for the fixed charge transportation problem
- A user's guide to tabu search
- Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
- Future paths for integer programming and links to artificial intelligence
- Properties of duality in tandem queueing systems
- Sequential arrays of waiting lines
- Tabu Search—Part I
- Tabu Search—Part II
- Tabu search applied to the general fixed charge problem
- The Output Processes of Serial Production Lines of Exponential Machines with Finite Buffers
- The effect of machine breakdowns and interstage storage on the performance of production line systems
- The tabu search metaheuristic: How we used it
Cited in
(15)- A parallel tabu search for solving the primal buffer allocation problem in serial production systems
- Mathematical programming formulations for approximate simulation of multistage production systems
- An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines
- Using tabu search to determine the number of kanbans and lotsizes in a generic kanban system
- Optimal budget allocation policy for tabu search in stochastic simulation optimization
- Buffer dimensioning and control stations positioning with a space partitioning-tabu search approach
- Capacity estimation of a multi-product unreliable production line
- Buffer allocation in stochastic flow lines via sample-based optimization with initial bounds
- Discrete time model for two-machine one-buffer transfer lines with restart policy
- A survey on metaheuristics for stochastic combinatorial optimization
- A new method for the placement of buffers in serial production lines
- The two-machine one-buffer continuous time model with restart policy
- Two approaches for solving the buffer allocation problem in unreliable production lines
- Hybrid approach for buffer allocation in open serial production lines
- Dynamic and steady-state performance analysis for multi-state repairable reconfigurable manufacturing systems with buffers
This page was built for publication: Determining buffer location and size in production lines using tabu search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1609894)
