Determining buffer location and size in production lines using tabu search
From MaRDI portal
Publication:1609894
DOI10.1016/S0377-2217(97)00276-2zbMATH Open0991.90046OpenAlexW2033563160WikidataQ57570784 ScholiaQ57570784MaRDI QIDQ1609894FDOQ1609894
Authors: Christian M. Lutz, K. Roscoe Davis, Minghe Sun 
Publication date: 18 August 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00276-2
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
- A user's guide to tabu search
- Title not available (Why is that?)
- Future paths for integer programming and links to artificial intelligence
- Tabu Search—Part I
- A tabu search heuristic procedure for the fixed charge transportation problem
- Sequential arrays of waiting lines
- Tabu Search—Part II
- The tabu search metaheuristic: How we used it
- The effect of machine breakdowns and interstage storage on the performance of production line systems
- Title not available (Why is that?)
- Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
- A tabu search heuristic procedure for solving the transportation problem with exclusionary side constraints
- The Output Processes of Serial Production Lines of Exponential Machines with Finite Buffers
- Tabu search applied to the general fixed charge problem
- Properties of duality in tandem queueing systems
Cited In (16)
- Optimal budget allocation policy for tabu search in stochastic simulation optimization
- Mathematical programming formulations for approximate simulation of multistage production systems
- Simulation optimization: a review of algorithms and applications
- A new method for the placement of buffers in serial production lines
- Buffer dimensioning and control stations positioning with a space partitioning-tabu search approach
- Buffer allocation in stochastic flow lines via sample-based optimization with initial bounds
- Using tabu search to determine the number of kanbans and lotsizes in a generic kanban system
- A survey on metaheuristics for stochastic combinatorial optimization
- Two approaches for solving the buffer allocation problem in unreliable production lines
- Hybrid approach for buffer allocation in open serial production lines
- A parallel tabu search for solving the primal buffer allocation problem in serial production systems
- Dynamic and steady-state performance analysis for multi-state repairable reconfigurable manufacturing systems with buffers
- The two-machine one-buffer continuous time model with restart policy
- An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines
- Discrete time model for two-machine one-buffer transfer lines with restart policy
- Capacity estimation of a multi-product unreliable production line
Uses Software
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)
