Mendoza, AbrahamAbrahamMendozaKWEI-LONG HUANGVentura, Jos? A.Jos? A.VenturaKWEI-LONG HUANG2019-09-262019-09-262012-01-01https://scholars.lib.ntu.edu.tw/handle/123456789/425356We consider a machining center that consists of a loading/unloading station, a CNC machine station, and a rotary table, which is the material handling device that moves jobs between these two stations simultaneously. Given a set of jobs that need to be processed on the machining center, the objective of the problem is to find the job sequence that minimizes the makespan. In this paper, a 0-1 mixed-integer linear programming model for this problem is presented. In addition, a heuristic algorithm is proposed to obtain near-optimal solutions for large-scale versions of the problem. Computational results are also provided.Flow shop scheduling | Heuristic algorithm | Makespan | Synchronous material movementconference paperhttps://api.elsevier.com/content/abstract/scopus_id/849003063342-s2.0-84900306334https://api.elsevier.com/content/abstract/scopus_id/84900306334