Machine scheduling for multitask machining

Multitasking is an important part of today’s manufacturing plants. Multitask machine tools are capable of processing multiple operations at the same time by applying a different set of part and tool holding devices. Mill-turns are multitask machines with the ability to perform a variety of operation...

Full description

Saved in:
Bibliographic Details
Published inJournal of optimization in industrial engineering Vol. 13; no. 2; pp. 1 - 15
Main Authors Saleh Yavari, Ahmed Azab, Mohammed Fazle Baki, Mikel Alcelay, Justin Britt
Format Journal Article
LanguageEnglish
Published Islamic Azad University, Qazvin Branch 01.07.2020
Subjects
mill-turn
mixed integer linear programming
multitasking
parallel machining
scheduling
simulated annealing
Online AccessGet full text

Cover

More Information
Summary:Multitasking is an important part of today’s manufacturing plants. Multitask machine tools are capable of processing multiple operations at the same time by applying a different set of part and tool holding devices. Mill-turns are multitask machines with the ability to perform a variety of operations with considerable accuracy and agility. One critical factor in simultaneous machining is to create a schedule for different operations to be completed in minimum make-span. A Mixed Integer Linear Programming (MILP) model is developed to address the machine scheduling problem. The adopted assumptions are more realistic when compared with the previous models. The model allows for processing multiple operations simultaneously on a single part; parts are being processed on the same setup and multiple turrets can process a single operation of a single job simultaneously performing multiple depths of cut. A Simulated Annealing algorithm with a novel initial solution and assignment approach is developed to solve large instances of the problem.
ISSN:2251-9904
2423-3935
DOI:10.22094/joie.2020.1869865.1660