Jaideep T. Naidu

Jul 19, 2024 | articlegateway.com | Jaideep T. Naidu |Thomas Jefferson

Abstract We consider the well-known optimal decomposition algorithm for the tardiness problem. The algorithm presents conditions which determine the positions a job could occupy in an optimal sequence. This resulted in optimal solutions for up to 100 jobs. We analyze these conditions and present simplified conditions. We then study a more recent Rule which when combined with these conditions resulted in optimal solutions for up to 500 jobs.

May 16, 2024 | articlegateway.com | Jaideep T. Naidu |Thomas Jefferson

Arrow, K., Harris, T., & Marshak, J. (1951). Optimal inventory policy. Econometrica, 19(3), 250–272. Chen, R.R., Cheng, T.C.E., Choi, T.M., & Wang, Y. (2016). Novel advances in applications of the newsvendor model. Decision Sciences, 47(1), 8–10. Chung, K.H. (1990). Risk in inventory models: The case of the newsboy problem -optimality conditions.