A Study of Solution of Combinatorial of New Product Problem Using Constraint Programming Planning and Simulation

Authors

  • Mr. Akash Pandey Research Scholar, Himalayan University Itanagar, Arunachal Pradesh Author
  • Dr. Umesh Kumar Gupta Associate Professor, M. G. P. G. College Gorakhpur (U.P.) Author

DOI:

https://doi.org/10.29070/n0qt9q07

Keywords:

combinatorial, new product problem, constraint programming, planning, simulation, decision support solutions, target costs, manufacturing, promotion, product development, prototyping, limited satisfaction, parametric estimates, relationships, restrictive programming, project requirement, resources, alternative scenarios, production process limits, total costs, declarative approach, product reliability

Abstract

Currently used decision support solutions allow decision-makers to estimate and compare the cost to the target costs of developing a new product, its manufacturing and promotion. These solutions are however insufficient to support simulation of conditions for identifying the specific costs. The proposed approach provides a framework to look for potential variants to achieve the target cost of production. This paper deals with the product development prototyping problem described in terms of the problem of limited satisfaction. The proposed method uses parametric estimates to identify relationships between different variables and restrictive programming to find variants to complete the project within the resources and project requirement of the company. Experiment results show that restrictive programming provides effective search strategies to find acceptable solutions. The proposed approach therefore provides decision makers with the option of obtaining alternative scenarios within production process limits. This exceeds current methods dedicated to the assessment of a new product's total costs. This paper uses the declarative approach to shape cost of production, but can be expanded easily to other aspects of product development (e.g., product reliability).

Downloads

Download data is not yet available.

References

Balas, E., Bockmayr, A., Pisaruk, N., Wolsey, L. (2014): On unions and dominants of polytopes. Mathematical Programming 99, pp. 223–239.

Spalek, S. (2018): Data Analytics in Project Management; CRC Press: Boca Raton, FL, USA.

Kuster, J.; Huber, E.; Lippmann, R.; Schmid, A.; Schneider, E.; Witschi, U.; Wüst, R. (2015): Project Management Handbook; Springer: Berlin/Heidelberg, Germany.

Benini, L., Bertozzi, D., Guerri, A., Milano, M. (2015): Allocation and scheduling for MPSoCs via decomposition and no-good generation. In: Principles and Practice of Constraint Programming (CP 2015), Lecture Notes in Computer Science, vol. 3709, pp. 107–121. Springer

Ulrich, K.T. (2012): Eppinger, S.D. Product Design and Development, 5th ed.; MacGraw-Hill: New York, NY, USA.

Bergman, D., Cire, A.A., van Hoeve, W.J. (2014): MDD Propagation for Sequence Constraints. JAIR 50, pp. 697–722.

Bergman, D., Cire, A.A., van Hoeve, W.J.: Improved Constraint Propagation via Lagrangian Decomposition. In: Proceedings of CP, Lecture Notes in Computer Science, vol. 9255, pp. 30–38. Springer (2015)

Derbyshire, J.; Giovannetti, E.G. Understanding the failure to understand New Product Development failures: Mitigating the uncertainty associated with innovating new products by combining scenario planning and forecasting. Technol. Forecast. Soc. Chang. 2017, 125, 334–344.

Hird, A.; Mendibil, K.; Duffy, A. (2015); Whitfield, R.I. New product development resource forecasting. R D Manag., 46, pp. 857–871.

Relich, M. (2016). Computational Intelligence for Estimating Cost of New Product Development. Found. Manag., 8, pp. 21–34.

Bergman, D., Cir´e, A.A., van Hoeve, W.J., Hooker, J.N. (2016): Discrete optimization with binary decision diagrams. INFORMS Journal on Computing 28, pp. 47–66.

Cambazard, H., Fages, J.G. (2015): New filtering for At Most N Value and its weighted variant: A Lagrangian approach. Constraints 20, pp. 362–380.

Capone, A., Carello, G., Filippini, I., Gualandi, S., Malucelli, F. (2017): Solving a resource allocation problem in wireless mesh networks: A comparison between a cp-based and a classical column generation. Networks 55(3), pp. 221–233.

Swi´c, A.; Gola, A. (2013): Economic analysis of casing parts production in a flexible manufacturing system. ´ Actual Probl. Econ., 141, pp. 526–533.

Castro, P.M., Grossmann, I.E. (2016): An efficient MILP model for the short-term scheduling of single stage batch plants. technical report, Departamento de Modela c˜ao e Simula c˜ao de Processos, INETI, Lisbon.

Relich, M. (2016): Portfolio selection of new product projects: A product reliability perspective. Ekspolatacja i Niezawodn. Maint. Reliab., 18, pp. 613–620.

Downloads

Published

2019-01-01

How to Cite

[1]
“A Study of Solution of Combinatorial of New Product Problem Using Constraint Programming Planning and Simulation”, JASRAE, vol. 16, no. 1, pp. 2948–2954, Jan. 2019, doi: 10.29070/n0qt9q07.