IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v135y2012i2p726-740.html
   My bibliography  Save this article

Multiple part-type scheduling in flexible robotic cells

Author

Listed:
  • Batur, G. Didem
  • Karasan, Oya Ekin
  • Akturk, M. Selim

Abstract

This paper considers the scheduling problem arising in two-machine manufacturing cells which repeatedly produce a set of multiple part-types, and where transportation of the parts between the machines is performed by a robot. The cycle time of the cell depends on the robot move sequence as well as the processing times of the parts on the machines. For highly flexible CNC machines, the processing times can be adjusted. To this end, this study tries to find the robot move sequence as well as the processing times of the parts on each machine that jointly minimize the cycle time. The problem of determining the best cycle in a 2-machine cell is first modeled as a traveling salesman problem. Then, an efficient 2-stage heuristic algorithm is constructed and compared with the most common heuristic approach of longest processing time (LPT).

Suggested Citation

  • Batur, G. Didem & Karasan, Oya Ekin & Akturk, M. Selim, 2012. "Multiple part-type scheduling in flexible robotic cells," International Journal of Production Economics, Elsevier, vol. 135(2), pages 726-740.
    • Handle: RePEc:eee:proeco:v:135:y:2012:i:2:p:726-740
    DOI: 10.1016/j.ijpe.2011.10.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527311004361
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2011.10.006?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Brauner, Nadia & Finke, Gerd, 2001. "Optimal moves of the material handling system in a robotic cell," International Journal of Production Economics, Elsevier, vol. 74(1-3), pages 269-277, December.
    2. Nicholas G. Hall & Hichem Kamoun & Chelliah Sriskandarajah, 1997. "Scheduling in Robotic Cells: Classification, Two and Three Machine Cells," Operations Research, INFORMS, vol. 45(3), pages 421-439, June.
    3. Paul, Henrik J. & Bierwirth, Christian & Kopfer, Herbert, 2007. "A heuristic scheduling procedure for multi-item hoist production lines," International Journal of Production Economics, Elsevier, vol. 105(1), pages 54-69, January.
    4. Wen, Charlie & Eksioglu, Sandra Duni & Greenwood, Allen & Zhang, Shu, 2010. "Crane scheduling in a shipbuilding environment," International Journal of Production Economics, Elsevier, vol. 124(1), pages 40-50, March.
    5. P. C. Gilmore & R. E. Gomory, 1964. "Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem," Operations Research, INFORMS, vol. 12(5), pages 655-679, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Solimanpur, Maghsud & Elmi, Atabak, 2013. "A tabu search approach for cell scheduling problem with makespan criterion," International Journal of Production Economics, Elsevier, vol. 141(2), pages 639-645.
    2. Son Duy Dao & Kazem Abhary & Romeo Marian, 2018. "An innovative model for resource scheduling in VCIM systems," Operational Research, Springer, vol. 18(1), pages 33-54, April.
    3. Mohammad Reza Komari Alaei & Mehmet Soysal & Atabak Elmi & Audrius Banaitis & Nerija Banaitiene & Reza Rostamzadeh & Shima Javanmard, 2021. "A Bender’s Algorithm of Decomposition Used for the Parallel Machine Problem of Robotic Cell," Mathematics, MDPI, vol. 9(15), pages 1-15, July.
    4. Gultekin, Hakan, 2012. "Scheduling in flowshops with flexible operations: Throughput optimization and benefits of flexibility," International Journal of Production Economics, Elsevier, vol. 140(2), pages 900-911.
    5. Choe, Pilsung & Tew, Jeffrey D. & Tong, Songzhen, 2015. "Effect of cognitive automation in a material handling system on manufacturing flexibility," International Journal of Production Economics, Elsevier, vol. 170(PC), pages 891-899.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Carlier, Jacques & Haouari, Mohamed & Kharbeche, Mohamed & Moukrim, Aziz, 2010. "An optimization-based heuristic for the robotic cell problem," European Journal of Operational Research, Elsevier, vol. 202(3), pages 636-645, May.
    2. Lin, Shih-Wei & Ying, Kuo-Ching, 2016. "Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics," Omega, Elsevier, vol. 64(C), pages 115-125.
    3. Smutnicki, Czeslaw & Pempera, Jaroslaw & Bocewicz, Grzegorz & Banaszak, Zbigniew, 2022. "Cyclic flow-shop scheduling with no-wait constraints and missing operations," European Journal of Operational Research, Elsevier, vol. 302(1), pages 39-49.
    4. Delorme, Xavier & Dolgui, Alexandre & Kovalev, Sergey & Kovalyov, Mikhail Y., 2019. "Minimizing the number of workers in a paced mixed-model assembly line," European Journal of Operational Research, Elsevier, vol. 272(1), pages 188-194.
    5. Soukhal, A. & Martineau, P., 2005. "Resolution of a scheduling problem in a flowshop robotic cell," European Journal of Operational Research, Elsevier, vol. 161(1), pages 62-72, February.
    6. Drobouchevitch, Inna G. & Sethi, Suresh P. & Sriskandarajah, Chelliah, 2006. "Scheduling dual gripper robotic cell: One-unit cycles," European Journal of Operational Research, Elsevier, vol. 171(2), pages 598-631, June.
    7. Kravchenko, Svetlana A., 1998. "A polynomial algorithm for a two-machine no-wait job-shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 106(1), pages 101-107, April.
    8. Vladimir G. Deineko & George Steiner & Zhihui Xue, 2005. "Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices," Journal of Combinatorial Optimization, Springer, vol. 9(4), pages 381-399, June.
    9. Kalczynski, Pawel J. & Kamburowski, Jerzy, 2009. "An empirical analysis of the optimality rate of flow shop heuristics," European Journal of Operational Research, Elsevier, vol. 198(1), pages 93-101, October.
    10. A.J. Scott, 1969. "Combinatorial Programming and the Planning of Urban and Regional Systems," Environment and Planning A, , vol. 1(2), pages 125-142, December.
    11. Chelliah Sriskandarajah & Inna Drobouchevitch & Suresh P. Sethi & Ramaswamy Chandrasekaran, 2004. "Scheduling Multiple Parts in a Robotic Cell Served by a Dual-Gripper Robot," Operations Research, INFORMS, vol. 52(1), pages 65-82, February.
    12. Çela, Eranda & Deineko, Vladimir & Woeginger, Gerhard J., 2012. "The x-and-y-axes travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 223(2), pages 333-345.
    13. Zhang, Xiaoju & Zeng, Qingcheng & Sheu, Jiuh-Biing, 2019. "Modeling the productivity and stability of a terminal operation system with quay crane double cycling," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 122(C), pages 181-197.
    14. Hichem Kamoun & Nicholas G. Hall & Chelliah Sriskandarajah, 1999. "Scheduling in Robotic Cells: Heuristics and Cell Design," Operations Research, INFORMS, vol. 47(6), pages 821-835, December.
    15. Hosseini, Amir & Otto, Alena & Pesch, Erwin, 2024. "Scheduling in manufacturing with transportation: Classification and solution techniques," European Journal of Operational Research, Elsevier, vol. 315(3), pages 821-843.
    16. Pranzo, Marco, 2004. "Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times," European Journal of Operational Research, Elsevier, vol. 153(3), pages 581-592, March.
    17. Ada Che & Vladimir Kats & Eugene Levner, 2011. "Cyclic scheduling in robotic flowshops with bounded work‐in‐process levels," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(1), pages 1-16, February.
    18. W Zahrouni & H Kamoun, 2011. "Transforming part-sequencing problems in a robotic cell into a GTSP," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 114-123, January.
    19. Chauhan, Satyaveer S. & Gordon, Valery & Proth, Jean-Marie, 2007. "Scheduling in supply chain environment," European Journal of Operational Research, Elsevier, vol. 183(3), pages 961-970, December.
    20. Imai, Akio & Yamakawa, Yukiko & Huang, Kuancheng, 2014. "The strategic berth template problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 72(C), pages 77-100.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:proeco:v:135:y:2012:i:2:p:726-740. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.