Review of batch process scheduling

Extensive research has been conducted on models that combine scheduling with decisions related to batching. Tasks may be grouped together if they utilize the same setup on a machine. Another scenario for batching arises when a machine has the capability to handle multiple tasks concurrently. This document examines the existing body of literature concerning scheduling with batching, providing in-depth information about fundamental algorithms and citing other noteworthy findings.In the paper, we pinpoint areas where techniques developed independently should be assessed and compared.As a multitude of articles have emerged in a short span, there are instances where various researchers have independently addressed the same issue, occasionally employing similar techniques, such as the genetic algorithm or simulated annealing algorithm or dynamic programming. This paper categorize the literature according to shop environments, including single machine, parallel machines, flow shop, no-wait flow shop, flexible flow shop, job shop, open shop, and others