Inventory Control and Scheduling of Multiple Products in a Common Facility
暂无分享,去创建一个
Consider a set of chemical products to be produced in a single facility. Each product has its own unique reaction time (which is assumed to be independent of its batch size), as well as other cost and demand values. In this paper, we address the problem of determining the optimal number of batches, batch sizes, and an accompanying production schedule for these products in the single facility that will minimize the total cost. Two different algorithms have been developed for this problem, the performances of which are contrasted with classical cyclic production schedules. Finally, some guidelines for the application of these methods to real-life problems are outlined.
[1] Mesbah U. Ahmed,et al. Minimizing the sum of absolute lateness in single‐machine and multimachine scheduling , 1984 .
[2] Yih-Long Chang,et al. MINIMIZING MEAN ABSOLUTE DEVIATION OF COMPLETION TIMES ABOUT A COMMON DUE DATE. , 1986 .
[3] S. Elmaghraby. The Economic Lot Scheduling Problem (ELSP): Review and Extensions , 1978 .
[4] J. J. Kanet. Minimizing the average deviation of job completion times about a common due date , 1981 .