Issues of mass customisation and supporting IT-solutions
Computers in Industry
Reconfigurable control of robotized manufacturing cells
Robotics and Computer-Integrated Manufacturing
Late work minimization in a small flexible manufacturing system
Computers and Industrial Engineering
Bicriteria robotic operation allocation in a flexible manufacturing cell
Computers and Operations Research
Hi-index | 0.00 |
The scheduling problem of robotic material handlers in flexible manufacturing systems (FMSs) is NP-hard. This paper proposes a state-dependent algorithm for the FMS robot scheduling problem in make-to-order (MTO) environments for mass customization (MC). A mathematical model of the problem is formulated. A computational study of the proposed algorithm is performed. The algorithm is compared to an effective FMS robot scheduling rule, the shortest remaining processing time first (SRPF) rule. The results reveal the effectiveness of the algorithm in increasing the productivity-based measures of the FMS. Practical application insights are discussed. Further research is also provided.