SavedAdd your journal

Journals / Gazi University Journal of Science / 2016 / Cilt: 29 - Sayı: 3

Using Simulated Annealing for Flexible Robotic Cell Scheduling

Gül Didem BATUR
Serpil EROL
Pages
573–582
Publication Date
2016-09-30
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

Experimental results show that this approach works well and can be extended for further cases.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:We focus on the scheduling problem arising in two-machine robotic cells in which sets of multiple part-types are produced.
📊
Key Findings & Data:Completion time of the production depends on the robot moves as well as the part assignments and processing times of the parts.
💡
Conclusion & Impact:Experimental results show that this approach works well and can be extended for further cases.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Flexible manufacturing systems · robotic cell · multiple part-type production

Abstract

We focus on the scheduling problem arising in two-machine robotic cells in which sets of multiple part-types are produced. Completion time of the production depends on the robot moves as well as the part assignments and processing times of the parts. We try to find the robot move sequence, the part sequence and the allocated processing times of the parts on each machine that jointly minimize the makespan. A simulated annealing based algorithm is proposed in order to solve the problem of determining the best schedule in a two-machine cell. Experimental results show that this approach works well and can be extended for further cases.

🔖

Cite This Article

BATUR, G. D., EROL, S. (2016). Using Simulated Annealing for Flexible Robotic Cell Scheduling. Gazi University Journal of Science, Cilt: 29 - Sayı: 3, 573–582. https://ajindex.com/articles/254712

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (15)

  1. Dawande, M., Geismar, N., Sethi, S.P., “Dominance of cyclic solutions and challenges in the scheduling of robotic cells”, SIAM Review, 47, 709-721, (2005).
  2. Gundogdu, E., Gultekin, H., “Scheduling in two-machine robotic cells with a self-buffered robot”, IIE Transactions, 48(2): 170-191, (2016).
  3. Gan, H-S., Wirth, A., Abdekhodaee, A., “A branch-and-price algorithm for the general case of scheduling paralel machines with a single server”, Computers and Operations Research, 39: 2242-2247, (2012).
  4. Hasani, K., Kravchenko, S.A., Werner, F., “Block models for scheduling jobs on two parallel machines with a single server”, Computers and Operations Research, 41: 94-97, (2014).
  5. Hasani, K., Kravchenko, S.A., Werner, F. “Minimising interference for scheduling two parallel machines with a single server”, International Journal of Production Research, 52(24): 7148-7158, (2014).
  6. Jiang, Y., Zhang, Q., Hu, J., Dong, J., Ji, M., “Single-server parallel-machine scheduling with loading and unloading times”, Journal of Combinatorial Optimization, 30(2): 201-213, (2015).
  7. Hasani, K., Kravchenko, S.A., Werner, F., “Minimizing the makespan for the two-machine scheduling problem with a single server: Two algorithms for very large instances”, Engineering Optimization, 48(1): 173-183, (2016).
  8. Balin, S., “Nonidentical parallel machine scheduling using genetic algorithm”, Expert Systems with Applications, 38, 6814-6821, (2011).
  9. Bilyk, A, Mönch, L., “A variable neighborhood search approach for planning and scheduling of jobs on unrelated parallel machines”, Journal of Intelligent Manufacturing, 23(5), 1621-1635, (2012).
  10. Browne, J., Harhen, J., Shivnan, J., Production Management Systems. New York: Addison-Wesley, (1996).
  11. Gultekin, H., Akturk, M.S., Karasan, O.E., “Robotic cell scheduling with tooling constraints”, European Journal of Operational Research, 174, 777-796, (2006).
  12. Jolai, F., Foumani, M., Tavakoli-Moghadam, R, Fattahi, P., “Cyclic scheduling of a robotic flexible cell with load lock and swap”, Journal of Intelligent Manufacturing 23(5), 1885-1891, (2012).
  13. Mansouri, S.A., Hendizadeh, S.H, Salmasi, N., “Bicriteria scheduling of a two-machine flowshop with sequence-dependent setup times”, International Journal of Advanced Manufacturing Technology, 40, 1216-1226, (2009).
  14. Naderi, B., Fatemi Ghomi S.M.T., Aminnayeri, M., “A high performing metaheuristic for job shop scheduling with sequence-dependent setup times”, Applied Soft Computing, 10, 703-710, (2010).
  15. Werner, F., Kravchenko, S