Home /Research /Schedule-Allocate and Robust Sequencing in Three-Machine Robotic Cell under Breakdowns
SWARM

Schedule-Allocate and Robust Sequencing in Three-Machine Robotic Cell under Breakdowns

Bahareh Vaisi, Hiwa Farughi, Sadigh Raissi

Year
2020
Citations
4
Access
Open access

Abstract

The purpose of this paper is to model two problems comprising schedule-allocate (in case of producing identical parts) and sequencing of parts (in case of producing different parts). The first model is used for minimizing the cycle time and operational cost, and the second one for minimizing both the mean and standard deviation of the total production cost as well the cycle time, in an unreliable three-machine robotic cell which confronted with many uncertainty factors. In the current article, mathematical modelling and simulation-based optimization method have been presented to schedule-allocate similar parts and trace the optimal sequence of different parts. Several solution procedures, including epsilon-constraint method and multiobjective particle swarm optimization algorithm, for identical parts case and response surface methodology for different parts case are applied. The results derived from solving numerical examples revealed some advantages in terms of time to attain the optimal solution.

Keywords

ScheduleMathematical optimizationParticle swarm optimizationSequence (biology)TRACE (psycholinguistics)Computer scienceConstraint (computer-aided design)EngineeringMathematics

Related papers

Browse all SWARM papers