Scheduling in a three-machine robotic flexible manufacturing cell
| dc.citation.epage | 2477 | en_US |
| dc.citation.issueNumber | 8 | en_US |
| dc.citation.spage | 2463 | en_US |
| dc.citation.volumeNumber | 34 | en_US |
| dc.contributor.author | Gultekin, H. | en_US |
| dc.contributor.author | Akturk, M. S. | en_US |
| dc.contributor.author | Karasan, O. E. | en_US |
| dc.date.accessioned | 2016-02-08T10:13:33Z | |
| dc.date.available | 2016-02-08T10:13:33Z | |
| dc.date.issued | 2007 | en_US |
| dc.department | Department of Industrial Engineering | en_US |
| dc.description.abstract | In this study, we consider a flexible manufacturing cell (FMC) processing identical parts on which the loading and unloading of machines are made by a robot. The machines used in FMCs are predominantly CNC machines and these machines are flexible enough for performing several operations provided that the required tools are stored in their tool magazines. Traditional research in this area considers a flowshop type system. The current study relaxes this flowshop assumption which unnecessarily limits the number of alternatives. In traditional robotic cell scheduling literature, the processing time of each part on each machine is a known parameter. However, in this study the processing times of the parts on the machines are decision variables. Therefore, we investigated the productivity gain attained by the additional flexibility introduced by the FMCs. We propose new lower bounds for the 1-unit and 2-unit robot move cycles (for which we present a completely new procedure to derive the activity sequences of 2-unit cycles in a three-machine robotic cell) under the new problem domain for the flowshop type robot move cycles. We also propose a new robot move cycle which is a direct consequence of process and operational flexibility of CNC machines. We prove that this proposed cycle dominates all 2-unit robot move cycles and present the regions where the proposed cycle dominates all 1-unit cycles. We also present a worst case performance bound of using this proposed cycle. | en_US |
| dc.description.provenance | Made available in DSpace on 2016-02-08T10:13:33Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2007 | en |
| dc.identifier.doi | 10.1016/j.cor.2005.09.015 | en_US |
| dc.identifier.eissn | 1873-765X | |
| dc.identifier.issn | 0305-0548 | |
| dc.identifier.uri | http://hdl.handle.net/11693/23410 | |
| dc.language.iso | English | en_US |
| dc.publisher | Elsevier | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1016/j.cor.2005.09.015 | en_US |
| dc.source.title | Computers & Operations Research | en_US |
| dc.subject | Automated manufacturing | en_US |
| dc.subject | Cyclic scheduling | en_US |
| dc.subject | Robotic cell | en_US |
| dc.title | Scheduling in a three-machine robotic flexible manufacturing cell | en_US |
| dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Scheduling_in_a_three-machine_robotic_flexible_manufacturing_cell.pdf
- Size:
- 278.65 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version