Modeling Batch Scheduling in a Three-Stage Flow Shop with Multi-Item on Batch-Job-Batch Processors to Minimize Total Actual Flow Time

This research discusses batch scheduling in a three-stage flow shop with batch-job-batch processors. The performance criterion of this research is to minimize the total actual flow time while considering multiple items that must be completed by a specified due date. This problem is formulated as a mathematical model and solved using a heuristic algorithm. The decision variables include the number of batches, batch size, batch position, and the start time of processing each batch at each stage. The model is tested through scenarios by varying parameters such as the number of batches, batch size, due date, and number of item types to assess the system's capability under different conditions. The test results show that the proposed scheduling model effectively solves the batch scheduling problem in a three-stage flow shop with batch-job-batch processing machines, minimizing the total actual flow time with a common due date. The results also indicate that the proposed model is sensitive to changes in parameters such as the demand for each item type, the capacity of the batch processing machine, and the number of item types, but not to changes in the common due date parameter.