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

Scheduling multiple robots in a no-wait re-entrant robotic flowshop

Author

Listed:
  • Che, Ada
  • Chabrol, Michelle
  • Gourgand, Michel
  • Wang, Yuan

Abstract

No-wait re-entrant robotic flowshops are widely used in the electronic industry, such as PCB and semiconductor manufacturing. In such an industry, cyclic production policy is often used due to large lot size and simplicity of implementation. This paper addresses cyclic scheduling of a no-wait re-entrant robotic flowshop with multiple robots for material handling. We formulate the problem and propose a polynomial algorithm to find the minimum number of robots for all feasible cycle times. Consequently, the minimum cycle time for any given number of robots can be obtained with the proposed algorithm. The algorithm runs in O(N5) time in the worst case, where N is the number of machines in the robotic flowshop.

Suggested Citation

  • Che, Ada & Chabrol, Michelle & Gourgand, Michel & Wang, Yuan, 2012. "Scheduling multiple robots in a no-wait re-entrant robotic flowshop," International Journal of Production Economics, Elsevier, vol. 135(1), pages 199-208.
    • Handle: RePEc:eee:proeco:v:135:y:2012:i:1:p:199-208
    DOI: 10.1016/j.ijpe.2011.07.008
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527311002921
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2011.07.008?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. SubaI, Corinne & Baptiste, Pierre & Niel, Eric, 2006. "Scheduling issues for environmentally responsible manufacturing: The case of hoist scheduling in an electroplating line," International Journal of Production Economics, Elsevier, vol. 99(1-2), pages 74-87, February.
    2. Sun, T. C. & Lai, K. K. & Lam, Kokin & So, K. P., 1994. "A study of heuristics for bidirectional multi-hoist production scheduling systems," International Journal of Production Economics, Elsevier, vol. 33(1-3), pages 207-214, January.
    3. Milind W. Dawande & H. Neil Geismar & Suresh P. Sethi & Chelliah Sriskandarajah, 2007. "Throughput Optimization in Robotic Cells," International Series in Operations Research and Management Science, Springer, number 978-0-387-70988-8, December.
    4. Vladimir Kats & Eugene Levner, 1997. "Minimizing the number of robots to meet a given cyclic schedule," Annals of Operations Research, Springer, vol. 69(0), pages 209-226, January.
    5. 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.
    6. Y. Crama & V. Kats & J. van de Klundert & E. Levner, 2000. "Cyclic scheduling in robotic flowshops," Annals of Operations Research, Springer, vol. 96(1), pages 97-124, November.
    7. Agnetis, A., 2000. "Scheduling no-wait robotic cells with two and three machines," European Journal of Operational Research, Elsevier, vol. 123(2), pages 303-314, June.
    8. Jiyin Liu & Yun Jiang, 2005. "An Efficient Optimal Solution to the Two-Hoist No-Wait Cyclic Scheduling Problem," Operations Research, INFORMS, vol. 53(2), pages 313-327, April.
    9. Tseng, Lin-Yu & Lin, Ya-Tai, 2010. "A genetic local search algorithm for minimizing total flowtime in the permutation flowshop scheduling problem," International Journal of Production Economics, Elsevier, vol. 127(1), pages 121-128, September.
    10. Lee, Wen-Chiung & Shiau, Yau-Ren & Chen, Shiuan-Kang & Wu, Chin-Chia, 2010. "A two-machine flowshop scheduling problem with deteriorating jobs and blocking," International Journal of Production Economics, Elsevier, vol. 124(1), pages 188-197, March.
    11. Levner, Eugene & Kats, Vladimir & Levit, Vadim E., 1997. "An improved algorithm for cyclic flowshop scheduling in a robotic cell," European Journal of Operational Research, Elsevier, vol. 97(3), pages 500-508, March.
    12. Tseng, Lin-Yu & Lin, Ya-Tai, 2010. "A hybrid genetic algorithm for no-wait flowshop scheduling problem," International Journal of Production Economics, Elsevier, vol. 128(1), pages 144-152, November.
    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. Allahverdi, Ali, 2016. "A survey of scheduling problems with no-wait in process," European Journal of Operational Research, Elsevier, vol. 255(3), pages 665-686.
    2. Yu, Yang & Tang, Jiafu & Sun, Wei & Yin, Yong & Kaku, Ikou, 2013. "Reducing worker(s) by converting assembly line into a pure cell system," International Journal of Production Economics, Elsevier, vol. 145(2), pages 799-806.
    3. Fatemi-Anaraki, Soroush & Tavakkoli-Moghaddam, Reza & Foumani, Mehdi & Vahedi-Nouri, Behdin, 2023. "Scheduling of Multi-Robot Job Shop Systems in Dynamic Environments: Mixed-Integer Linear Programming and Constraint Programming Approaches," Omega, Elsevier, vol. 115(C).

    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. Che, Ada & Chu, Chengbin, 2009. "Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots," European Journal of Operational Research, Elsevier, vol. 199(1), pages 77-88, November.
    2. Drobouchevitch, Inna G. & Neil Geismar, H. & Sriskandarajah, Chelliah, 2010. "Throughput optimization in robotic cells with input and output machine buffers: A comparative study of two key models," European Journal of Operational Research, Elsevier, vol. 206(3), pages 623-633, November.
    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. 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.
    5. 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.
    6. 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.
    7. 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.
    8. Janny M. Y. Leung & Guoqing Zhang & Xiaoguang Yang & Raymond Mak & Kokin Lam, 2004. "Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach," Operations Research, INFORMS, vol. 52(6), pages 965-976, December.
    9. Shabtay, Dvir & Arviv, Kfir & Stern, Helman & Edan, Yael, 2014. "A combined robot selection and scheduling problem for flow-shops with no-wait restrictions," Omega, Elsevier, vol. 43(C), pages 96-107.
    10. Milind Dawande & Michael Pinedo & Chelliah Sriskandarajah, 2009. "Multiple Part-Type Production in Robotic Cells: Equivalence of Two Real-World Models," Manufacturing & Service Operations Management, INFORMS, vol. 11(2), pages 210-228, February.
    11. Neil Geismar, H. & Dawande, Milind & Sriskandarajah, Chelliah, 2005. "Approximation algorithms for k-unit cyclic solutions in robotic cells," European Journal of Operational Research, Elsevier, vol. 162(2), pages 291-309, April.
    12. Tharanga Rajapakshe & Milind Dawande & Chelliah Sriskandarajah, 2011. "Quantifying the Impact of Layout on Productivity: An Analysis from Robotic-Cell Manufacturing," Operations Research, INFORMS, vol. 59(2), pages 440-454, April.
    13. Kats, Vladimir & Levner, Eugene, 2018. "On the existence of dominating 6-cyclic schedules in four-machine robotic cells," European Journal of Operational Research, Elsevier, vol. 268(2), pages 755-759.
    14. Che, Ada & Feng, Jianguang & Chen, Haoxun & Chu, Chengbin, 2015. "Robust optimization for the cyclic hoist scheduling problem," European Journal of Operational Research, Elsevier, vol. 240(3), pages 627-636.
    15. Wang, Sheng-yao & Wang, Ling & Liu, Min & Xu, Ye, 2013. "An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem," International Journal of Production Economics, Elsevier, vol. 145(1), pages 387-396.
    16. Bagchi, Tapan P. & Gupta, Jatinder N.D. & Sriskandarajah, Chelliah, 2006. "A review of TSP based approaches for flowshop scheduling," European Journal of Operational Research, Elsevier, vol. 169(3), pages 816-854, March.
    17. Allahverdi, Ali, 2016. "A survey of scheduling problems with no-wait in process," European Journal of Operational Research, Elsevier, vol. 255(3), pages 665-686.
    18. Kan Fang & Nelson Uhan & Fu Zhao & John Sutherland, 2016. "Scheduling on a single machine under time-of-use electricity tariffs," Annals of Operations Research, Springer, vol. 238(1), pages 199-227, March.
    19. Wang, Ling & Sun, Lin-Yan & Sun, Lin-Hui & Wang, Ji-Bo, 2010. "On three-machine flow shop scheduling with deteriorating jobs," International Journal of Production Economics, Elsevier, vol. 125(1), pages 185-189, May.
    20. Meloni, Carlo & Pranzo, Marco & Samà, Marcella, 2022. "Evaluation of VaR and CVaR for the makespan in interval valued blocking job shops," International Journal of Production Economics, Elsevier, vol. 247(C).

    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:1:p:199-208. 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.