A multi due date batch scheduling model on dynamic flow shop to minimize total production cost

This research solved a batch scheduling problem on dynamic flow shop environment, in which new orders are considered to insert in the current work. Decision making is made by comparing the total cost of the insertion schedule with the original schedule. Another feature of this model is its ability to accommodate multi product orders that are delivered on different due dates in which revised due date is allowed for each order. The proposed model is known as Mix Integer Non Linear Programming (MINLP) with a convex objective function. An algorithm is developed to find the best solutions of batch size and sequence that minimize total cost. A numerical experience is performed to show how the algorithm works.