IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v95y2005i2p139-149.html
   My bibliography  Save this article

A set covering formulation for agile capacity planning within supply chains

Author

Listed:
  • Cochran, Jeffery K.
  • Marquez Uribe, Alberto

Abstract

No abstract is available for this item.

Suggested Citation

  • Cochran, Jeffery K. & Marquez Uribe, Alberto, 2005. "A set covering formulation for agile capacity planning within supply chains," International Journal of Production Economics, Elsevier, vol. 95(2), pages 139-149, February.
    • Handle: RePEc:eee:proeco:v:95:y:2005:i:2:p:139-149
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(03)00383-9
    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. Grossman, Tal & Wool, Avishai, 1997. "Computational experience with approximation algorithms for the set covering problem," European Journal of Operational Research, Elsevier, vol. 101(1), pages 81-92, August.
    2. Alminana, Marcos & Pastor, Jesus T., 1997. "An adaptation of SH heuristic to the location set covering problem," European Journal of Operational Research, Elsevier, vol. 100(3), pages 586-593, August.
    3. Joseph B. Mazzola & Robert H. Schantz, 1995. "Single-Facility Resource Allocation Under Capacity-Based Economies and Diseconomies of Scope," Management Science, INFORMS, vol. 41(4), pages 669-689, April.
    4. Lorena, Luiz Antonio N. & Belo Lopes, Fabio, 1994. "A surrogate heuristic for set covering problems," European Journal of Operational Research, Elsevier, vol. 79(1), pages 138-150, November.
    5. Goutam Dutta & Robert Fourer, 2001. "A Survey of Mathematical Programming Applications in Integrated Steel Plants," Manufacturing & Service Operations Management, INFORMS, vol. 3(4), pages 387-400.
    6. William C. Jordan & Stephen C. Graves, 1995. "Principles on the Benefits of Manufacturing Process Flexibility," Management Science, INFORMS, vol. 41(4), pages 577-594, April.
    7. George Pfeil & Ron Holcomb & Charles T. Muir & Shahram Taj, 2000. "Visteon's Sterling Plant Uses Simulation-Based Decision Support in Training, Operations, and Planning," Interfaces, INFORMS, vol. 30(1), pages 115-133, February.
    8. Saifallah Benjaafar, 2002. "Modeling and Analysis of Congestion in the Design of Facility Layouts," Management Science, INFORMS, vol. 48(5), pages 679-704, May.
    9. Constantinos Maglaras & Assaf Zeevi, 2003. "Pricing and Capacity Sizing for Systems with Shared Resources: Approximate Solutions and Scaling Relations," Management Science, INFORMS, vol. 49(8), pages 1018-1038, August.
    10. Paias, Ana & Paixao, J., 1993. "State space relaxation for set covering problems related to bus driver scheduling," European Journal of Operational Research, Elsevier, vol. 71(2), pages 303-316, December.
    11. Beasley, J. E. & Chu, P. C., 1996. "A genetic algorithm for the set covering problem," European Journal of Operational Research, Elsevier, vol. 94(2), pages 392-404, October.
    12. Julien Bramel & David Simchi-Levi, 1997. "On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows," Operations Research, INFORMS, vol. 45(2), pages 295-301, April.
    13. Fourer, Robert & Dutta, Goutam, 2000. "A Survey of Mathematical Programming Applications In Integrated Steel Plants," IIMA Working Papers WP2000-06-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    14. Marshall L. Fisher & Pradeep Kedia, 1990. "Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics," Management Science, INFORMS, vol. 36(6), pages 674-688, June.
    15. El-Darzi, Elia & Mitra, Gautam, 1995. "Graph theoretic relaxations of set covering and set partitioning problems," European Journal of Operational Research, Elsevier, vol. 87(1), pages 109-121, November.
    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. Georgiadis, Patroklos & Athanasiou, Efstratios, 2013. "Flexible long-term capacity planning in closed-loop supply chains with remanufacturing," European Journal of Operational Research, Elsevier, vol. 225(1), pages 44-58.
    2. Yao, Jianming & Liu, Liwen, 2009. "Optimization analysis of supply chain scheduling in mass customization," International Journal of Production Economics, Elsevier, vol. 117(1), pages 197-211, January.
    3. Jordi Pereira & Igor Averbakh, 2013. "The Robust Set Covering Problem with interval data," Annals of Operations Research, Springer, vol. 207(1), pages 217-235, August.
    4. Julka, Nirupam & Baines, Tim & Tjahjono, Benny & Lendermann, Peter & Vitanov, Val, 2007. "A review of multi-factor capacity expansion models for manufacturing plants: Searching for a holistic decision aid," International Journal of Production Economics, Elsevier, vol. 106(2), pages 607-621, April.
    5. Morteza Abbasi & Reza Hosnavi & Mehrdad Mohammadi, 2013. "Designing a Fuzzy Strategic Integrated Multiechelon Agile Supply Chain Network," Journal of Optimization, Hindawi, vol. 2013, pages 1-16, June.
    6. Das, Kanchan, 2011. "Integrating effective flexibility measures into a strategic supply chain planning model," European Journal of Operational Research, Elsevier, vol. 211(1), pages 170-183, May.

    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. Wang, Yiyuan & Pan, Shiwei & Al-Shihabi, Sameh & Zhou, Junping & Yang, Nan & Yin, Minghao, 2021. "An improved configuration checking-based algorithm for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 294(2), pages 476-491.
    2. Ablanedo-Rosas, José H. & Rego, César, 2010. "Surrogate constraint normalization for the set covering problem," European Journal of Operational Research, Elsevier, vol. 205(3), pages 540-551, September.
    3. Bautista, Joaquín & Pereira, Jordi, 2006. "Modeling the problem of locating collection areas for urban waste management. An application to the metropolitan area of Barcelona," Omega, Elsevier, vol. 34(6), pages 617-629, December.
    4. Victor Reyes & Ignacio Araya, 2021. "A GRASP-based scheme for the set covering problem," Operational Research, Springer, vol. 21(4), pages 2391-2408, December.
    5. Alberto Caprara & Matteo Fischetti & Paolo Toth, 1999. "A Heuristic Method for the Set Covering Problem," Operations Research, INFORMS, vol. 47(5), pages 730-743, October.
    6. Gao, Chao & Yao, Xin & Weise, Thomas & Li, Jinlong, 2015. "An efficient local search heuristic with row weighting for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 246(3), pages 750-761.
    7. Helena R. Lourenço & José P. Paixão & Rita Portugal, 2001. "Multiobjective Metaheuristics for the Bus Driver Scheduling Problem," Transportation Science, INFORMS, vol. 35(3), pages 331-343, August.
    8. Lan, Guanghui & DePuy, Gail W. & Whitehouse, Gary E., 2007. "An effective and simple heuristic for the set covering problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1387-1403, February.
    9. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.
    10. Patrizia Beraldi & Andrzej Ruszczyński, 2002. "The Probabilistic Set-Covering Problem," Operations Research, INFORMS, vol. 50(6), pages 956-967, December.
    11. Singer, Marcos & Donoso, Patricio, 2008. "Empirical validation of an activity-based optimization system," International Journal of Production Economics, Elsevier, vol. 113(1), pages 335-345, May.
    12. Galvao, Roberto D. & Gonzalo Acosta Espejo, Luis & Boffey, Brian, 2000. "A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem," European Journal of Operational Research, Elsevier, vol. 124(2), pages 377-389, July.
    13. Chunyan Liu & Hejiao Huang & Hongwei Du & Xiaohua Jia, 2017. "Optimal RSUs placement with delay bounded message dissemination in vehicular networks," Journal of Combinatorial Optimization, Springer, vol. 33(4), pages 1276-1299, May.
    14. Ibrahim, Walid & El-Sayed, Hesham & El-Chouemie, Amr & Amer, Hoda, 2009. "An adaptive heuristic algorithm for VLSI test vectors selection," European Journal of Operational Research, Elsevier, vol. 199(3), pages 630-639, December.
    15. Lorena, Luiz Antonio N. & Goncalves Narciso, Marcelo, 2002. "Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems," European Journal of Operational Research, Elsevier, vol. 138(3), pages 473-483, May.
    16. Christoph Meyer & Matthias G. Wichmann & Thomas S. Spengler, 2016. "Management of recycling operations for iron and steel making slags," Journal of Business Economics, Springer, vol. 86(7), pages 773-808, October.
    17. Irnich, Stefan, 2000. "A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles," European Journal of Operational Research, Elsevier, vol. 122(2), pages 310-328, April.
    18. Singer, Marcos & Donoso, Patricio, 2006. "Strategic decision-making at a steel manufacturer assisted by linear programming," Journal of Business Research, Elsevier, vol. 59(3), pages 387-390, March.
    19. Zhengyu Ma & Hong Seo Ryoo, 2021. "Spherical Classification of Data, a New Rule-Based Learning Method," Journal of Classification, Springer;The Classification Society, vol. 38(1), pages 44-71, April.
    20. Koutras, M. V. & Tsitmidelis, S. & Zissimopoulos, V., 2003. "Evaluation of reliability bounds by set covering models," Statistics & Probability Letters, Elsevier, vol. 61(2), pages 163-175, January.

    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:proeco:v:95:y:2005:i:2:p:139-149. 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/ijpe .

    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.