Article ID: | iaor20002787 |
Country: | United States |
Volume: | 8 |
Issue: | 4 |
Start Page Number: | 433 |
End Page Number: | 444 |
Publication Date: | Dec 1999 |
Journal: | Production and Operations Management |
Authors: | Verma Sushil, Dessouky Maged, Kijowski Brian |
Keywords: | programming: integer |
We consider the problem of determining the allocation of demand from different customer orders to production batches and the schedule of resulting batches to minimize the total weighted earliness and tardiness penalties in context of batch chemical processing. The problem is formulated as a mixed-integer nonlinear programming model. An iterative heuristic procedure that makes use of the network nature of the problem formulation is presented to approximate an optimal solution. An algorithm polynomial in the number of batches to produce is also presented that optimally solves the problem under special cost structures.