Multiobjective Production Planning at LG Display

Published Online:https://doi.org/10.1287/inte.2017.0891

References

  • Belvaux G, Wolsey LA (2001) Modelling practical lot-sizing problems as mixed-integer programs. Management Sci. 47(7):993–1007.LinkGoogle Scholar
  • Borodin D, Vreckem BV, Bruyn WD (2011) Case study: An effective genetic algorithm for the chemical batch production scheduling. Accessed January 25, 2017, https://expertise.hogent.be/files/9123095/mista2011_submission_66.pdf.Google Scholar
  • Chan FTS, Chung SH, Wadhwa S (2005) A hybrid genetic algorithm for production and distribution. OMEGA 33(4):345–355.CrossrefGoogle Scholar
  • Chang S, Chung J (2013) Optimization models for production planning in LG Display. Interfaces 43(6):518–529.LinkGoogle Scholar
  • Chen M, Cao D (2004) Coordinating production planning in cellular manufacturing environment using Tabu search. Comput. Indust. Engrg. 46(3):571–588.CrossrefGoogle Scholar
  • Das K, Baki MF, Li X (2009) Optimization of operation and changeover time for production planning and scheduling in a flexible manufacturing system. Comput. Indust. Engrg. 56(1): 283–293.CrossrefGoogle Scholar
  • Floudas CA, Lin X (2005) Mixed integer linear programming in process scheduling: Modeling, algorithms, and applications. Ann. Oper. Res. 139(1):131–162.CrossrefGoogle Scholar
  • Guo ZX, Wong WK, Li Z, Ren P (2013) Modeling and Pareto optimization of multi-objective order scheduling problems in production planning. Comput. Indust. Engrg. 64(4):972–986.CrossrefGoogle Scholar
  • Hmida JB, Lee J, Wang X, Boukadi F (2014) Production scheduling for continuous manufacturing systems with quality constraints. Production Manufacturing Res. 2(1):95–111.CrossrefGoogle Scholar
  • Jin H, Yang G (2013) A Tabu search algorithm to optimize the scheduling problem for the polyamide fiber plants. Internat. J. Advancements Comput. Tech. 5(69):627–635.Google Scholar
  • Laguna M (1999) A heuristic for production scheduling and inventory control in the presence of sequence-dependent setup times. IIE Trans. 31(2):125–134.CrossrefGoogle Scholar
  • Lejeune MA, Margot F (2007) Integer programming solution approach for inventory-production-distribution problems with direct shipments. Internat. Trans. Oper. Res. 15(3):259–281.CrossrefGoogle Scholar
  • Loveland JL, Monkman SK, Morrice DJ (2007) Dell uses a new production-scheduling algorithm to accommodate increased product variety. Interfaces 37(3):209–219.LinkGoogle Scholar
  • Mahalec V, Castillo PC (2014) Nonlinear blend scheduling via inventory pinch-based algorithm using discrete- and continuous-time models. Chemical Biochemical Engrg. Quart. 28(4):425–436.CrossrefGoogle Scholar
  • Massimiliano C, Paolo D (2008) Multi-Objective Management in Freight Logistics: Increasing Capacity, Service Level and Safety with Optimization Algorithms, 1st ed. (Springer-Verlag, London).Google Scholar
  • Miller AJ, Wolsey LA (2003) Tight MIP formulation for multi-item discrete lot-sizing problems. Oper. Res. 51(4):557–565.LinkGoogle Scholar
  • Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J. ACM 7(4):326–329.CrossrefGoogle Scholar
  • Moreno MS, Montagna JM (2009) A multi-period model for production planning and design in a multiproduct batch environment. Math. Comput. Model. 49(7–8):1372–1385.CrossrefGoogle Scholar
  • Pochet Y (2001) Mathematical programming models and formulations for deterministic production planning problems. Junger M, Naddef D, eds. Computational Combinatorial Optimization (Springer, Berlin), 57–111.CrossrefGoogle Scholar
  • Tang L, Luh PB, Liu J, Fang L (2002) Steel-making process scheduling using Lagrangian relaxation. Internat. J. Production Res. 40(1):55–70.CrossrefGoogle Scholar
  • Wolsey LA (1997) MIP modelling of changeovers in production planning and scheduling problems. Eur. J. Oper. Res. 99(1):154–165.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.