Optimization of the Allocation and Scheduling System in the Supply Chain by Using the Karush-Khun-Tucker (KKT) Method

  • Oktovianus R. Sikas Matematika, Universitas Timor
  • Eva Binsasi Universitas Timor
Keywords: Kata kunci: Metode Karus-Kuhn-Tucker (KKT), Penjadwalan, Rantai Pasokan, Lagrange, Optimasi

Abstract

This study was conducted to estimate the company's optimal profit by considering the product supply chain in a company that receives orders from several distributors. If all orders cannot be fulfilled by the available production capacity, the company will offer a solution in allocating capacity to distributors by considering scheduling costs and other constraints. The main work in estimating the company's profit is modeling the scheduling costs and constraints in the capacity allocation problem in the company. That is, the company makes order scheduling to minimize costs to achieve maximum profit by applying the Karush-Kuhn-Tucker (KKT) method. Karush-Khun-Tucker can be used to find the optimal solution of the function formed from the allocation and scheduling problems whether linear or nonlinear. In the process, the KKT method basically involves the same steps as the Lagrange method to be able to calculate the critical point and find the optimum solution. It is suggested for further research to involve more varied variables with more interesting cases.

Downloads

Download data is not yet available.

References

Bazaraa, M. S., Sherali, H.D., dan Shetty, C. 2006. Nonlinier Programming. John Wiley dan Sons Inc, Canada.

Boyd, S., dan Vandenberghe, L. 2004.Convex Optimization. Cambridge, New York.

A. Taha, H. 1996. Riset Operasi.Terjemahan Daniel Wirajaya. Jakarta: Penerbit Binarupa Aksara.

Baker, Kenneth R. 1974. Introduction to Sequencing and Scheduling. John Willey & Sons, Inc.: New York.

Bailey, James E. and Bedworth, David D. 1987. Integrated Production Control Systems: Management, Analysis, Design 2/E. John Willey & Sons, Inc.: New York.

Cachon, G. P., M. A. Lariviere., 1999a, Capacity allocation using past sales: When to turn-and-earn, Management Sci. 45(5) 685-703.

Cachon, G. P., M. A. Lariviere. 1999b, Capacity choice and allocation: Strategic behavior and supply chain performance, Management Sci. 45(8) 1091-1108.

Chakravarty, A. K., N. Balakrishnan. 2004, Real-time revision of order quantities with capacity constraints: A single period model Production Oper, Management 13(2) 171-185.

Durango-Cohen, E. J., C. A. Yano. 2006. Supplier commitment and production decisions under a forecast-commitment contract, Management Sci. 52(1) 54-67.

Goldfarb, D., S. Liu. 1993. An O(n3L) primal-dual potential reduction algorithm for solving convex quadratic programs. Math. Programming 61(1-3) 161-170.

Karabuk, S., S. D. Wu. 2005. Incentive schemes for semiconductor capacity allocation: A game theoretic analysis. Production Oper. Management 14(2) 175-188.

Iyer, A. V., V. Deshpande, Z. P. Wu. 2003. A postponement model for demand management, Management Sci. 49(8) 983-1002.

Nicholas G. Hall and Zhixin Liu.,2010, Capacity Allocation and Scheduling in Supply Chains, Operations Research, pp. 1711-1725.

Pinedo, M. 2002.Scheduling, Theory, Algorithms and Systems, 2nd ed. Prentice Hall, Englewood Cliffs, NJ.

Sikas R. Oktovianus. 2017, Alokasi Kapasitas dan Penjadwalan pada Rantai Pasokan. Universitas Gadjah Mada, Yogyakarta.

Smith, W. E. 1956, Various optimizers for single-stage production, Naval Res. Logist. Quart. 3 59-66.

Winston. 1993, Operations Research : Applications and Algorithms. Thomson Learning Inc, Canada.
Published
2021-08-04
How to Cite
Sikas, O., & Binsasi, E. (2021). Optimization of the Allocation and Scheduling System in the Supply Chain by Using the Karush-Khun-Tucker (KKT) Method. Jurnal Saintek Lahan Kering, 4(1), 9-11. https://doi.org/https://doi.org/10.32938/slk.v4i1.1405
Section
Original research article