Ventura, J.A.J.A.VenturaHuang, K.-L.K.-L.HuangMendoza, A.A.Mendoza2023-08-032023-08-032012https://scripta.up.edu.mx/handle/20.500.12552/4648Abstract We 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.Resource Types::text::conference output::conference proceedings::conference paper