论文信息 - Network Models for Production Scheduling Problems with Convex Cost and Batch Processing

Network Models for Production Scheduling Problems with Convex Cost and Batch Processing

Abstract This paper considers a class of production scheduling problems which can be modeled as network flow problems. The problems are addressed under the assumption that production occurs in batches. We also require that the cost function be convex and separable. The model applies for a number of well known production scheduling problems and will handle multiple products and multiple facilities.

H. Donald Ratliff

[1] W. Zangwill. A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System---A Network Approach , 1969 .

[2] William L. Maxwell,et al. The scheduling of economic lot sizes , 1964 .

[3] Salah E. Elmaghraby,et al. Scheduling a Single Facility under Constant Demand and Fixed Production Rate. , 1973 .

[4] H. D. Ratliff,et al. A Network Approach to a Multi-Facility, Multi-Product Production Scheduling Problem Without Backordering , 1975 .

[5] H. D. Ratliff,et al. Technical Note - A Production-Scheduling Problem with Batch Processing , 1974, Oper. Res..

[6] S. Elmaghraby,et al. OPTIMIZATION OF BATCH ORDERING UNDER DETERMINISTIC VARIABLE DEMAND , 1972 .

[7] Salah E. Elmaghraby,et al. The Scheduling of Lots on a Single Facility , 1970 .

[8] W. Zangwill. Minimum Concave Cost Flows in Certain Networks , 1968 .

[9] E. H. Bowman. Production Scheduling by the Transportation Method of Linear Programming , 1956 .

[10] Jr. Arthur F. Veinott. The Status of Mathematical Inventory Theory , 1966 .

[11] Salah E. Elmaghraby,et al. THE SCHEDULING OF A MULTI-PRODUCT FACILITY , 1973 .

[12] T. C. Hu. Minimum‐cost flows in convex‐cost networks , 1966 .

[13] D. R. Fulkerson. Flow Networks and Combinatorial Operations Research , 1966 .