Title: Job Shop Batch-Cyclic Scheduling Method in The Manufacturing Area Conference paper: 50th International Conference on Computers and Industrial Engineering: Sustainable Digital Transformation, CIE 2023 Sharjah Authors: Najat Almasarwah, Esraa Abdelall, Alanood A Alsarayreh ABSTRACT: This paper aims to solve the batch-cyclic job shop scheduling problem in the manufacturing systems, where machine duplication in a cell is not allowed. In this regard, a new method is proposed to minimize the makespan. Three steps are followed to achieve the objective of the propounded method. In this first step, the clustering tree is utilized to assign the products into groups based on the similarity of flow directionality, where machine skipping is not allowed in each group. In the second step, a Hasse Diagram is used to define the minimal product sets needed to meet the demand for each product in the system. Finally, the mathematical model is employed to minimize the makespan. To evaluate the performance of the proposed batch-cyclic job shop scheduling method, the obtained results are compared to the batch job shop scheduling method. The results illustrate the ability of the propounded batch-cyclic job shop scheduling method to minimize the makespan compared to the batch job shop scheduling method. The efficiency of the proposed method decreases as the similarity of flow directionality decreases. However, an increase in the makespan leads to an improved production rate; thus, the number of cells needed to meet the demand decreases.