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

4Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to 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.

Cite

CITATION STYLE

APA

Vaisi, B., Farughi, H., & Raissi, S. (2020). Schedule-Allocate and Robust Sequencing in Three-Machine Robotic Cell under Breakdowns. Mathematical Problems in Engineering, 2020. https://doi.org/10.1155/2020/4597827

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free