Volume 29, Issue 3 (IJIEPR 2018)                   IJIEPR 2018, 29(3): 343-357 | Back to browse issues page

XML Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Vaisi B, Farughi H, Raissi S. Bi-Criteria Robotic Cell Scheduling and Operation Allocation in the Presence of Break-downs. IJIEPR 2018; 29 (3) :343-357
URL: http://ijiepr.iust.ac.ir/article-1-809-en.html
Bi-Criteria Robotic Cell Scheduling and Operation Allocation in the Presence of Break-downs
Bahareh Vaisi1 , Hiwa Farughi 2, Sadigh Raissi3
1- School of Industrial Engineering South Tehran Branch, Islamic Azad University, Tehran, Iran
2- Department of Engineering, University of Kurdistan, Sanandaj, Iran , h.farughi@uok.ac.ir
3- School of Industrial Engineering, South Tehran Branch, Islamic Azad University, Tehran, Iran
Abstract:   (4469 Views)
This paper focused on scheduling problems arising in a two-machine, identical parts robotic cell configured in a flow shop. Through current research, a mathematical programming model on minimizing cycle time as well operational cost, considering availability of robotic cell as a constraint, is proposed to search for the optimum allocation and schedule of operations to these two machines. Two solution procedures, including weighted sum method and ∊-constraint method are provided. Based on the weighted sum method, like some previous studies, sensitivity analysis on model parameters were done and the optimum solutions were compared with previous results, while the ∊-constraint method can find the Pareto optimal solutions for problems with up to 18 operations in a reasonable time.
Keywords: Robotic manufacturing cell, Scheduling, Breakdowns, weighted sum method, ∊-constraint method.
Full-Text [PDF 1230 kb]   (2072 Downloads)    
Type of Study: Research | Subject: Other Related Subject
Received: 2018/01/29 | Accepted: 2018/06/12 | Published: 2018/09/23
Add your comments about this article : Your username or Email:
CAPTCHA
Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.