Optimization-based parts–machines matching in flexible manufacturing systems

Optimization-based parts–machines matching in flexible manufacturing systems

0.00 Avg rating0 Votes
Article ID: iaor20022748
Country: United Kingdom
Volume: 40
Issue: 4
Start Page Number: 763
End Page Number: 781
Publication Date: Jan 2002
Journal: International Journal of Production Research
Authors: , ,
Keywords: scheduling
Abstract:

A new dynamic scheduling strategy, Parts–Machines Matching (PMM), is developed and tested in simulated flexible manufacturing systems. This strategy is aimed to achieve globally optimal matching between parts and machines by a semi-qualitative optimization algorithm, originally developed for the Stable Marriage Problem. Global and partial implementations of PMM are presented and compared with other conventional part-flow rules. They are found to achieve better shop performance than conventional rules, in terms of system throughput, robustness against travel time uncertainties, and recovery from machine breakdowns. The prospect of bringing about system-wide optimization-based performance improvements into bidding schemes makes the proposed framework very significant.

Reviews

Required fields are marked *. Your email address will not be published.