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

Production planning and scheduling for injection moulding of pipe fittings A case study

Author

Listed:
  • Nagarur, Nagen
  • Vrat, Prem
  • Duongsuwan, Wanchai

Abstract

No abstract is available for this item.

Suggested Citation

  • Nagarur, Nagen & Vrat, Prem & Duongsuwan, Wanchai, 1997. "Production planning and scheduling for injection moulding of pipe fittings A case study," International Journal of Production Economics, Elsevier, vol. 53(2), pages 157-170, November.
    • Handle: RePEc:eee:proeco:v:53:y:1997:i:2:p:157-170
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(97)00109-6
    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. Alan S. Manne, 1958. "Programming of Economic Lot Sizes," Management Science, INFORMS, vol. 4(2), pages 115-135, January.
    2. Kalpic, Damir & Mornar, Vedran & Baranovic, Mirta, 1995. "Case study based on a multi-period multi-criteria production planning model," European Journal of Operational Research, Elsevier, vol. 87(3), pages 658-669, December.
    3. Caie, J & Linden, J & Maxwell, W, 1980. "Solution of a single stage machine load planning problem," Omega, Elsevier, vol. 8(3), pages 355-360.
    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. repec:dgr:rugsom:02a12 is not listed on IDEAS
    2. Chowdary, Boppana V. & Slomp, Jannes, 2002. "Production planning under dynamic product environment: a multi-objective goal programming approach," Research Report 02A12, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    3. Seunghoon Lee & Yongju Cho & Young Hoon Lee, 2020. "Injection Mold Production Sustainable Scheduling Using Deep Reinforcement Learning," Sustainability, MDPI, vol. 12(20), pages 1-17, October.

    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. Sankaran, Jayaram K., 1995. "Column generation applied to linear programs in course registration," European Journal of Operational Research, Elsevier, vol. 87(2), pages 328-342, December.
    2. Toy, Ayhan Özgür & Berk, Emre, 2013. "Dynamic lot sizing for a warm/cold process: Heuristics and insights," International Journal of Production Economics, Elsevier, vol. 145(1), pages 53-66.
    3. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    4. Degraeve, Z. & Jans, R.F., 2003. "Improved Lower Bounds For The Capacitated Lot Sizing Problem With Set Up Times," ERIM Report Series Research in Management ERS-2003-026-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.
    5. Tao Wu & Zhe Liang & Canrong Zhang, 2018. "Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 236-258, May.
    6. Nadjib Brahimi & Stéphane Dauzère-Pérès & Najib M. Najid, 2006. "Capacitated Multi-Item Lot-Sizing Problems with Time Windows," Operations Research, INFORMS, vol. 54(5), pages 951-967, October.
    7. Yiyong Xiao & Meng You & Xiaorong Zuo & Shenghan Zhou & Xing Pan, 2018. "The Uncapacitatied Dynamic Single-Level Lot-Sizing Problem under a Time-Varying Environment and an Exact Solution Approach," Sustainability, MDPI, vol. 10(11), pages 1-14, October.
    8. Li, Yuchen & Liu, Ming & Saldanha-da-Gama, Francisco & Yang, Zaoli, 2024. "Risk-averse two-stage stochastic programming for assembly line reconfiguration with dynamic lot sizes," Omega, Elsevier, vol. 127(C).
    9. 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.
    10. Hax, Arnoldo C. & Meal, Harlan C., 1973. "Hierarchical integration of production planning and scheduling," Working papers 656-73., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    11. Aria Shahsavar & Nima Zoraghi & Babak Abbasi, 2018. "Integration of resource investment problem with quantity discount problem in material ordering for minimizing resource costs of projects," Operational Research, Springer, vol. 18(2), pages 315-342, July.
    12. Beraudy, Sébastien & Absi, Nabil & Dauzère-Pérès, Stéphane, 2022. "Timed route approaches for large multi-product multi-step capacitated production planning problems," European Journal of Operational Research, Elsevier, vol. 300(2), pages 602-614.
    13. Shi Li, 2020. "Constant Approximation Algorithm for Nonuniform Capacitated Multi-Item Lot Sizing via Strong Covering Inequalities," Mathematics of Operations Research, INFORMS, vol. 45(3), pages 947-965, August.
    14. Okhrin, Irena & Richter, Knut, 2011. "The linear dynamic lot size problem with minimum order quantity," International Journal of Production Economics, Elsevier, vol. 133(2), pages 688-693, October.
    15. Kerem Akartunalı & Ioannis Fragkos & Andrew J. Miller & Tao Wu, 2016. "Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 766-780, November.
    16. Okhrin, Irena & Richter, Knut, 2011. "An O(T3) algorithm for the capacitated lot sizing problem with minimum order quantities," European Journal of Operational Research, Elsevier, vol. 211(3), pages 507-514, June.
    17. Xue, Guisen & Felix Offodile, O. & Zhou, Hong & Troutt, Marvin D., 2011. "Integrated production planning with sequence-dependent family setup times," International Journal of Production Economics, Elsevier, vol. 131(2), pages 674-681, June.
    18. Leão, Aline A.S. & Santos, Maristela O. & Hoto, Robinson & Arenales, Marcos N., 2011. "The constrained compartmentalized knapsack problem: mathematical models and solution methods," European Journal of Operational Research, Elsevier, vol. 212(3), pages 455-463, August.
    19. Harvey M. Wagner, 2002. "And Then There Were None," Operations Research, INFORMS, vol. 50(1), pages 217-226, February.
    20. Silvio Alexandre de Araujo & Bert De Reyck & Zeger Degraeve & Ioannis Fragkos & Raf Jans, 2015. "Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times," INFORMS Journal on Computing, INFORMS, vol. 27(3), pages 431-448, August.

    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:53:y:1997:i:2:p:157-170. 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.