Özpeynirci, SelinGökgür, Burak2023-06-162023-06-1620139.79E+12https://hdl.handle.net/20.500.14365/3983Inst. Syst. Technol. Inf., Control Commun. (INSTICC)2nd International Conference on Operations Research and Enterprise Systems, ICORES 2013 -- 16 February 2013 through 18 February 2013 -- Barcelona -- 97006In our problem, there are a number of jobs to be processed on parallel computer numerically controlled machines. Each job requires a set of tools and the required tools must be loaded to process the jobs. The machines have limited tool magazine capacities and the number of tools available in the system is limited due to economic restrictions, which leads to the need for switching tools. We assume that the tool switching time constitutes a significant portion of total processing time and does not depend on the number or type of tools changed. The problem is to assign the jobs and the required tools to machines and determine the schedule so that the makespan is minimized. A mathematical model and a heuristic approach based on the decomposition of the problem are developed.eninfo:eu-repo/semantics/closedAccessFlexible manufacturing systemsMathematical modellingSchedulingTool switchingHeuristic approachMakespanParallel computerTool magazineTool switchingTotal processing timeFlexible manufacturing systemsHeuristic methodsMathematical modelsOperations researchSchedulingScheduling algorithmsSwitchingConference Object2-s2.0-84877975127