SIMULTANEOUS BATCHING AND SCHEDULING FOR CHEMICAL PROCESSING WITH EARLINESS AND TARDINESS PENALTIES

Maged Dessouky; Brian A. Kijowski; Sushil Verma

doi:10.1111/j.1937-5956.1999.tb00317.x

SIMULTANEOUS BATCHING AND SCHEDULING FOR CHEMICAL PROCESSING WITH EARLINESS AND TARDINESS PENALTIES

Maged Dessouky^1,2; Brian A. Kijowski^3,4; Sushil Verma^5,6

¹ University of Southern California · ² System Simulation (United Kingdom) · ³ Wilkes University · ⁴ United States Army · ⁵ Institute of Applied Technology · ⁶ SA Technologies (United States)

Production and Operations Management 1999

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.

DOI: 10.1111/j.1937-5956.1999.tb00317.x
Export: BibTeX
Sources: openalex