Modeling and Optimization of Resource Allocation in Supply Chain Management Problems
暂无分享,去创建一个
[1] John O. McClain,et al. Coordinating production and inventory to improve service , 1997 .
[2] Shimon Even,et al. Graph Algorithms: Flow in Networks , 2011 .
[3] M. Iri. A NEW METHOD OF SOLVING TRANSPORTATION· NETWORK PROBLEMS , 1960 .
[4] Alysson M. Costa. A survey on benders decomposition applied to fixed-charge network design problems , 2005, Comput. Oper. Res..
[5] Stephanie A. Jernigan. Multi-Tier Inventory Systems With Space Constraints , 2004 .
[6] Robert E. Tarjan,et al. Network Flow Algorithms , 1989 .
[7] Moncer Hariga,et al. A continuous review (Q, r) model with owned and rented storage facilities , 2009, 2009 International Conference on Computers & Industrial Engineering.
[8] Andrew Tomkins,et al. Informed multi-process prefetching and caching , 1997, SIGMETRICS '97.
[9] J Figueira,et al. Using mathematical programming heuristics in a multicriteria network flow context , 1998, J. Oper. Res. Soc..
[10] Luis Angel D. Bathen,et al. AMP: Adaptive Multi-stream Prefetching in a Shared Cache , 2007, FAST.
[11] Ryszard J. Pryputniewicz,et al. Measurement and Modeling of MEMS , 2006 .
[12] Shuai Zhang,et al. A new manufacturing resource allocation method for supply chain optimization using extended genetic algorithm , 2011 .
[13] Dongsheng Xu,et al. Demand Allocation in Systems with Multiple Inventory Locations and Multiple Demand Sources , 2008, Manuf. Serv. Oper. Manag..
[14] Robert V. Brill,et al. Applied Statistics and Probability for Engineers , 2004, Technometrics.
[15] W. Walker. A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem , 1976 .
[16] Andrew V. Goldberg,et al. Finding minimum-cost circulations by canceling negative cycles , 1989, JACM.
[17] B. C. Cha,et al. A continuous review inventory model with the controllable production rate of the manufacturer , 2005, Int. Trans. Oper. Res..
[18] Y. Charlie Hu,et al. The Performance Impact of Kernel Prefetching on Buffer Cache Replacement Algorithms , 2005, IEEE Transactions on Computers.
[19] David A. Patterson,et al. Computer Architecture: A Quantitative Approach , 1969 .
[20] Hoong Chuin Lau,et al. Vehicle routing problem with time windows and a limited number of vehicles , 2003, Eur. J. Oper. Res..
[21] C. L. Monma,et al. A primal algorithm for finding minimum-cost flows in capacitated networks with applications , 1982, The Bell System Technical Journal.
[22] Zhe Zhang,et al. Memory resource allocation for file system prefetching: from a supply chain management perspective , 2009, EuroSys '09.
[23] D. A. Schrady,et al. Models for multi‐item continuous review inventory policies subject to constraints , 1971 .
[24] Don T. Phillips,et al. Fundamentals Of Network Analysis , 1981 .
[25] Memorandum RM-5383-PR. MAXIMIZING FLOW THROUGH A NETWORK WITH NODE AND ARC CAPACITIES , 2015 .
[26] Geraldo Robson Mateus,et al. Solving to optimality the uncapacitated fixed-charge network flow problem , 1998, Comput. Oper. Res..
[27] E. Stanley Lee,et al. Fuzzy multi-level minimum cost flow problems , 1999, Fuzzy Sets Syst..
[28] M. Klein. A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems , 1966 .
[29] Pei Cao. Application-controlled file caching and prefetching , 1996 .
[30] Paul Tseng,et al. Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems , 1988, Oper. Res..
[31] Clyde L. Monma,et al. Send-and-Split Method for Minimum-Concave-Cost Network Flows , 1987, Math. Oper. Res..
[32] W. Zangwill. Minimum Concave Cost Flows in Certain Networks , 1968 .
[33] Saudi Arabia,et al. A SIMULATION OPTIMIZATION SOLUTION TO THE INVENTORY CONTINUOUS REVIEW PROBLEM WITH LOT SIZE DEPENDENT LEAD TIME , 2007 .
[34] A. Weintraub. A Primal Algorithm to Solve Network Flow Problems with Convex Costs , 1974 .
[35] Heeseok Lee,et al. Simultaneous determination of capacities and load in parallel M/M/1 queues , 1994 .
[36] Willard I. Zangwill,et al. Cost Minimization in Networks with Discrete Stochastic Requirements , 1971, Oper. Res..
[37] Palle Thoft-Christensen,et al. The Branch-and-Bound Method , 1986 .
[38] Alan Jay Smith,et al. The performance impact of I/O optimizations and disk improvements , 2004, IBM J. Res. Dev..
[39] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[40] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[41] N. Wang,et al. Reliability Modeling in Spatially Distributed Logistics Systems , 2006, IEEE Transactions on Reliability.
[42] James B. Orlin,et al. Minimum Convex Cost Dynamic Network Flows , 1984, Math. Oper. Res..
[43] John M. Mulvey,et al. Pivot Strategies for Primal-Simplex Network Codes , 1978, JACM.
[44] S. Chopra,et al. Supply Chain Management: Strategy, Planning & Operation , 2007 .
[45] Ken Darby-Dowman,et al. Discrete Structures and Algorithms , 1981 .
[46] Rakesh Nagi,et al. Strategic capacity planning in supply chain design for a new market opportunity , 2004 .
[47] Barton A. Smith. Discrete Structures and Algorithms , 1981 .
[48] Liang-Yuh Ouyang,et al. Mixture inventory model involving variable lead time with a service level constraint , 1997, Comput. Oper. Res..
[49] Ellis L. Johnson,et al. Networks and Basic Solutions , 1966, Oper. Res..
[50] Ilkyeong Moon,et al. The distribution free continuous review inventory system with a service level constraint , 1994 .
[51] Song Jiang,et al. STEP: Sequentiality and Thrashing Detection Based Prefetching to Improve Performance of Networked Storage Servers , 2007, 27th International Conference on Distributed Computing Systems (ICDCS '07).
[52] Stephen C. Graves,et al. Continuous-Review Policies for a Multi-Echelon Inventory Problem With Stochastic Demand , 2017 .
[53] H. Pirkul,et al. New formulation and relaxation to solve a concave-cost network flow problem , 1997 .
[54] A. Vazacopoulos,et al. SUPPLY CHAIN OPTIMIZATION , 2005 .
[55] Brian Kallehauge,et al. The Vehicle Routing Problem with Time Windows , 2006, Vehicle Routing.
[56] Thomas L. Magnanti,et al. Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..
[57] Vladimir Vacic,et al. VEHICLE ROUTING PROBLEM WITH TIME WINDOWS , 2014 .
[58] A. Victor Cabot,et al. Some branch‐and‐bound procedures for fixed‐cost transportation problems , 1984 .
[59] D. R. Fulkerson,et al. An Out-of-Kilter Method for Minimal-Cost Flow Problems , 1960 .
[60] Minghe Sun,et al. Tabu search applied to the general fixed charge problem , 1993, Ann. Oper. Res..
[61] Xin Huang,et al. Capacity planning in a general supply chain with multiple contract types , 2008 .
[62] Mehdi Ghatee,et al. Application of fuzzy minimum cost flow problems to network design under uncertainty , 2009, Fuzzy Sets Syst..
[63] Kai Shen,et al. Competitive prefetching for concurrent sequential I/O , 2007, EuroSys '07.
[64] Hon-Shiang Lau,et al. Simple formulas for the expected costs in the newsboy problem: An educational note , 1997, Eur. J. Oper. Res..
[65] Wu Zhang,et al. On practical resource allocation for production planning and scheduling with period overlapping setups , 1994 .
[66] Michel Gendreau,et al. Production , Manufacturing and Logistics An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles , 2009 .
[67] Rasoul Haji,et al. A multi-product continuous review inventory system with stochastic demand, backorders, and a budget constraint , 2004, Eur. J. Oper. Res..
[68] Gerald G. Brown,et al. Design and Implementation of Large-Scale Primal Transshipment Algorithms , 1976 .
[69] D. R. Fulkerson,et al. A primal‐dual algorithm for the capacitated Hitchcock problem , 1957 .
[70] R. V. Helgason,et al. Algorithms for network programming , 1980 .
[71] K. Schittkowski,et al. NONLINEAR PROGRAMMING , 2022 .