IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v106y1998i2-3p301-316.html
   My bibliography  Save this article

Determining buffer location and size in production lines using tabu search

Author

Listed:
  • Lutz, Christian M.
  • Roscoe Davis, K.
  • Sun, Minghe

Abstract

No abstract is available for this item.

Suggested Citation

  • Lutz, Christian M. & Roscoe Davis, K. & Sun, Minghe, 1998. "Determining buffer location and size in production lines using tabu search," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 301-316, April.
    • Handle: RePEc:eee:ejores:v:106:y:1998:i:2-3:p:301-316
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(97)00276-2
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Sun, Minghe & Aronson, Jay E. & McKeown, Patrick G. & Drinka, Dennis, 1998. "A tabu search heuristic procedure for the fixed charge transportation problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 441-456, April.
    2. Gordon C. Hunt, 1956. "Sequential Arrays of Waiting Lines," Operations Research, INFORMS, vol. 4(6), pages 674-683, December.
    3. Genji Yamazaki & Hirotaka Sakasegawa, 1975. "Properties of duality in tandem queueing systems," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 27(1), pages 201-212, December.
    4. Richard Conway & William Maxwell & John O. McClain & L. Joseph Thomas, 1988. "The Role of Work-in-Process Inventory in Serial Production Lines," Operations Research, INFORMS, vol. 36(2), pages 229-241, April.
    5. Kevin B. Hendricks, 1992. "The Output Processes of Serial Production Lines of Exponential Machines with Finite Buffers," Operations Research, INFORMS, vol. 40(6), pages 1139-1147, December.
    6. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    7. Kevin B. Hendricks & John O. McClain, 1993. "The Output Process of Serial Production Lines of General Machines with Finite Buffers," Management Science, INFORMS, vol. 39(10), pages 1194-1201, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hachicha, Wafik & Ammeri, Ahmed & Masmoudi, Faouzi & Chachoub, Habib, 2010. "A comprehensive literature classification of simulation optimisation methods," MPRA Paper 27652, University Library of Munich, Germany.
    2. Elisa Gebennini & Andrea Grassi & Cesare Fantuzzi, 2015. "The two-machine one-buffer continuous time model with restart policy," Annals of Operations Research, Springer, vol. 231(1), pages 33-64, August.
    3. Zhang, Yongjin & Zhao, Ming & Zhang, Yanjun & Pan, Ruilin & Cai, Jing, 2020. "Dynamic and steady-state performance analysis for multi-state repairable reconfigurable manufacturing systems with buffers," European Journal of Operational Research, Elsevier, vol. 283(2), pages 491-510.
    4. Alfieri, Arianna & Matta, Andrea, 2012. "Mathematical programming formulations for approximate simulation of multistage production systems," European Journal of Operational Research, Elsevier, vol. 219(3), pages 773-783.
    5. Satyajith Amaran & Nikolaos V. Sahinidis & Bikram Sharda & Scott J. Bury, 2016. "Simulation optimization: a review of algorithms and applications," Annals of Operations Research, Springer, vol. 240(1), pages 351-380, May.
    6. Elisa Gebennini & Andrea Grassi & Cesare Fantuzzi & Stanley Gershwin & Irvin Schick, 2013. "Discrete time model for two-machine one-buffer transfer lines with restart policy," Annals of Operations Research, Springer, vol. 209(1), pages 41-65, October.
    7. Puchkova, Alena & McFarlane, Duncan & Srinivasan, Rengarajan & Thorne, Alan, 2020. "Resilient planning strategies to support disruption-tolerant production operations," International Journal of Production Economics, Elsevier, vol. 226(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hadjinicola, George C. & Soteriou, Andreas C., 2003. "Reducing the cost of defects in multistage production systems: A budget allocation perspective," European Journal of Operational Research, Elsevier, vol. 145(3), pages 621-634, March.
    2. Kalir, Adar A. & Sarin, Subhash C., 2009. "A method for reducing inter-departure time variability in serial production lines," International Journal of Production Economics, Elsevier, vol. 120(2), pages 340-347, August.
    3. Chen, Chin-Tai & Yuan, John, 2004. "Transient throughput analysis for a series type system of machines in terms of alternating renewal processes," European Journal of Operational Research, Elsevier, vol. 155(1), pages 178-197, May.
    4. Tan, Baris, 1997. "Variance of the throughput of an N-station production line with no intermediate buffers and time dependent failures," European Journal of Operational Research, Elsevier, vol. 101(3), pages 560-576, September.
    5. Papadopoulos, H. T. & Heavey, C., 1996. "Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines," European Journal of Operational Research, Elsevier, vol. 92(1), pages 1-27, July.
    6. G C Hadjinicola, 2010. "Manufacturing costs in serial production systems with rework," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(2), pages 342-351, February.
    7. Dukwon Kim & Xinyan Pan & Panos Pardalos, 2006. "An Enhanced Dynamic Slope Scaling Procedure with Tabu Scheme for Fixed Charge Network Flow Problems," Computational Economics, Springer;Society for Computational Economics, vol. 27(2), pages 273-293, May.
    8. Papadopoulos, H. T., 1998. "An approximate method for calculating the mean sojourn time of K-station production lines with no intermediate buffers," International Journal of Production Economics, Elsevier, vol. 54(3), pages 297-305, May.
    9. Hirotaka Sakasegawa & Genji Yamazaki, 1977. "Inequalities and an approximation formula for the mean delay time in tandem queueing systems," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 29(1), pages 445-466, December.
    10. Stephen G. Powell & Kenneth L. Schultz, 2004. "Throughput in Serial Lines with State-Dependent Behavior," Management Science, INFORMS, vol. 50(8), pages 1095-1105, August.
    11. Marianov, Vladimir & Serra, Daniel & ReVelle, Charles, 1999. "Location of hubs in a competitive environment," European Journal of Operational Research, Elsevier, vol. 114(2), pages 363-371, April.
    12. Chiara Gruden & Irena Ištoka Otković & Matjaž Šraml, 2020. "Neural Networks Applied to Microsimulation: A Prediction Model for Pedestrian Crossing Time," Sustainability, MDPI, vol. 12(13), pages 1-22, July.
    13. Helena Ramalhinho-Lourenço & Olivier C. Martin & Thomas Stützle, 2000. "Iterated local search," Economics Working Papers 513, Department of Economics and Business, Universitat Pompeu Fabra.
    14. Сластников С.А., 2014. "Применение Метаэвристических Алгоритмов Для Задачи Маршрутизации Транспорта," Журнал Экономика и математические методы (ЭММ), Центральный Экономико-Математический Институт (ЦЭМИ), vol. 50(1), pages 117-126, январь.
    15. Hanafi, Said & Freville, Arnaud, 1998. "An efficient tabu search approach for the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 659-675, April.
    16. Bolte, Andreas & Thonemann, Ulrich Wilhelm, 1996. "Optimizing simulated annealing schedules with genetic programming," European Journal of Operational Research, Elsevier, vol. 92(2), pages 402-416, July.
    17. Rego, Cesar & Roucairol, Catherine, 1995. "Using Tabu search for solving a dynamic multi-terminal truck dispatching problem," European Journal of Operational Research, Elsevier, vol. 83(2), pages 411-429, June.
    18. Pirlot, Marc, 1996. "General local search methods," European Journal of Operational Research, Elsevier, vol. 92(3), pages 493-511, August.
    19. Nair, D.J. & Grzybowska, H. & Fu, Y. & Dixit, V.V., 2018. "Scheduling and routing models for food rescue and delivery operations," Socio-Economic Planning Sciences, Elsevier, vol. 63(C), pages 18-32.
    20. Cazzaro, Davide & Fischetti, Martina & Fischetti, Matteo, 2020. "Heuristic algorithms for the Wind Farm Cable Routing problem," Applied Energy, Elsevier, vol. 278(C).

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:106:y:1998:i:2-3:p:301-316. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.