论文信息 - Solving the single-item, capacitated dynamic lot-sizing problem with startup and reservation costs by tabu search - 字舞流文

Solving the single-item, capacitated dynamic lot-sizing problem with startup and reservation costs by tabu search

[1] Richard A. Sandbothe,et al. The capacitated dynamic lot-sizing problem with startup and reservation costs: A forward algorithm solution , 1991 .

[2] Rema Padman,et al. Dual Algorithms for Pure Network Problems , 1989, Oper. Res..

[3] Paul Tseng,et al. Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems , 1988, Oper. Res..

[4] G. D. Eppen,et al. Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition , 1987, Oper. Res..

[5] Uday S. Karmarkar,et al. The Dynamic Lot-Sizing Problem with Startup and Reservation Costs , 1987, Oper. Res..

[6] Fred W. Glover,et al. Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[7] K. R. Baker,et al. An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints , 1978 .

[8] M. Florian,et al. DETERMINISTIC PRODUCTION PLANNING WITH CONCAVE COSTS AND CAPACITY CONSTRAINTS. , 1971 .

[9] M. D. Grigoriadis,et al. An efficient implementation of the network simplex method , 1986 .

[10] Graham K. Rand,et al. Decision Systems for Inventory Management and Production Planning , 1979 .

[11] Alan S. Manne,et al. Programming of Economic Lot Sizes , 1958 .