IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v175y2006i2p1117-1140.html
   My bibliography  Save this article

Build-pack planning for hard disk drive assembly with approved vendor matrices and stochastic demands

Author

Listed:
  • Ng, T.S.
  • Lee, L.H.
  • Chew, E.P.

Abstract

No abstract is available for this item.

Suggested Citation

  • Ng, T.S. & Lee, L.H. & Chew, E.P., 2006. "Build-pack planning for hard disk drive assembly with approved vendor matrices and stochastic demands," European Journal of Operational Research, Elsevier, vol. 175(2), pages 1117-1140, December.
    • Handle: RePEc:eee:ejores:v:175:y:2006:i:2:p:1117-1140
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00539-4
    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. Lee, L. H. & Chew, E. P. & Ng, T. S., 2005. "Production planning with approved vendor matrices for a hard-disk drive manufacturer," European Journal of Operational Research, Elsevier, vol. 162(2), pages 310-324, April.
    2. S. D. Hodges & P. G. Moore, 1970. "The Product-Mix Problem under Stochastic Seasonal Demand," Management Science, INFORMS, vol. 17(2), pages 107-114, October.
    3. Leif H. Appelgren, 1969. "A Column Generation Algorithm for a Ship Scheduling Problem," Transportation Science, INFORMS, vol. 3(1), pages 53-68, February.
    4. P. C. Gilmore & R. E. Gomory, 1961. "A Linear Programming Approach to the Cutting-Stock Problem," Operations Research, INFORMS, vol. 9(6), pages 849-859, December.
    5. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    6. A. A. Farley, 1990. "A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems," Operations Research, INFORMS, vol. 38(5), pages 922-923, October.
    7. Zuo-Jun Max Shen & Collette Coullard & Mark S. Daskin, 2003. "A Joint Location-Inventory Model," Transportation Science, INFORMS, vol. 37(1), pages 40-55, February.
    8. Chu, Sydney C. K., 1995. "A mathematical programming approach towards optimized master production scheduling," International Journal of Production Economics, Elsevier, vol. 38(2-3), pages 269-279, March.
    9. Stephen C. Graves, 1982. "Using Lagrangean Techniques to Solve Hierarchical Production Planning Problems," Management Science, INFORMS, vol. 28(3), pages 260-275, March.
    10. Cynthia Barnhart & Christopher A. Hane & Pamela H. Vance, 2000. "Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems," Operations Research, INFORMS, vol. 48(2), pages 318-326, April.
    11. Jayashankar M. Swaminathan & Sridhar R. Tayur, 1998. "Managing Broader Product Lines through Delayed Differentiation Using Vanilla Boxes," Management Science, INFORMS, vol. 44(12-Part-2), pages 161-172, December.
    12. Raghu Garud & Arun Kumaraswamy, 1993. "Changing competitive dynamics in network industries: An exploration of sun microsystems' open systems strategy," Strategic Management Journal, Wiley Blackwell, vol. 14(5), pages 351-369, July.
    Full references (including those not matched with items on IDEAS)

    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. Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
    2. Omid Shahvari & Rasaratnam Logendran & Madjid Tavana, 2022. "An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems," Journal of Scheduling, Springer, vol. 25(5), pages 589-621, October.
    3. Thomas C. Sharkey & Joseph Geunes & H. Edwin Romeijn & Zuo‐Jun Max Shen, 2011. "Exact algorithms for integrated facility location and production planning problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(5), pages 419-436, August.
    4. Lee, L. H. & Chew, E. P. & Ng, T. S., 2005. "Production planning with approved vendor matrices for a hard-disk drive manufacturer," European Journal of Operational Research, Elsevier, vol. 162(2), pages 310-324, April.
    5. Giuseppe Lancia & Paolo Serafini, 2016. "Deriving compact extended formulations via LP-based separation techniques," Annals of Operations Research, Springer, vol. 240(1), pages 321-350, May.
    6. Ng, Tsan Sheng & Sun, Yang & Fowler, John, 2010. "Semiconductor lot allocation using robust optimization," European Journal of Operational Research, Elsevier, vol. 205(3), pages 557-570, September.
    7. Zeger Degraeve & Marc Peeters, 2003. "Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results," INFORMS Journal on Computing, INFORMS, vol. 15(1), pages 58-81, February.
    8. Rostami, Borzou & Malucelli, Federico & Belotti, Pietro & Gualandi, Stefano, 2016. "Lower bounding procedure for the asymmetric quadratic traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 253(3), pages 584-592.
    9. Amy Cohn & Michael Magazine & George Polak, 2009. "Rank‐Cluster‐and‐Prune: An algorithm for generating clusters in complex set partitioning problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(3), pages 215-225, April.
    10. Barry C. Smith & Ellis L. Johnson, 2006. "Robust Airline Fleet Assignment: Imposing Station Purity Using Station Decomposition," Transportation Science, INFORMS, vol. 40(4), pages 497-516, November.
    11. Kang, Jangha & Park, Kyungchul & Park, Sungsoo, 2009. "Optimal multicast route packing," European Journal of Operational Research, Elsevier, vol. 196(1), pages 351-359, July.
    12. Claudio Arbib & Fabrizio Marinelli & Fabrizio Rossi & Francesco Di Iorio, 2002. "Cutting and Reuse: An Application from Automobile Component Manufacturing," Operations Research, INFORMS, vol. 50(6), pages 923-934, December.
    13. C Alves & J M Valério de Carvalho, 2008. "New integer programming formulations and an exact algorithm for the ordered cutting stock problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(11), pages 1520-1531, November.
    14. Laszlo Ladanyi & Jon Lee & Robin Lougee-Heimer, 2005. "Rapid Prototyping of Optimization Algorithms Using COIN-OR: A Case Study Involving the Cutting-Stock Problem," Annals of Operations Research, Springer, vol. 139(1), pages 243-265, October.
    15. Klose, Andreas & Gortz, Simon, 2007. "A branch-and-price algorithm for the capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1109-1125, June.
    16. Huisman, D. & Jans, R.F. & Peeters, M. & Wagelmans, A.P.M., 2003. "Combining Column Generation and Lagrangian Relaxation," ERIM Report Series Research in Management ERS-2003-092-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    17. Sarah Root & Amy Cohn, 2008. "A novel modeling approach for express package carrier planning," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(7), pages 670-683, October.
    18. Lijun Wei & Zhixing Luo, & Roberto Baldacci & Andrew Lim, 2020. "A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 428-443, April.
    19. Brønmo, Geir & Nygreen, Bjørn & Lysgaard, Jens, 2006. "Column generation approaches to ship scheduling with flexible cargo sizes," CORAL Working Papers L-2006-07, University of Aarhus, Aarhus School of Business, Department of Business Studies.
    20. Baris Yildiz & Martin Savelsbergh, 2019. "Provably High-Quality Solutions for the Meal Delivery Routing Problem," Transportation Science, INFORMS, vol. 53(5), pages 1372-1388, September.

    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:175:y:2006:i:2:p:1117-1140. 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.