Scheduling multiple parts in hybrid flow shop robotic cells served by a single robot

References

• Agnetis, A. 2000. “Scheduling No-Wait Robotic Cells with Two and Three Machines.” European Journal of Operational Research 123 (2): 303–314.
   Web of Science ®Google Scholar
• Agnetis, A., and D. Pacciarelli. 2000. “Number Sequencing in Three Machine No-Wait Robotic Cells.” Operations Research Letters 27 (4): 185–192.
   Web of Science ®Google Scholar
• Alaykýran, K., O. Engin, and A. Döyen. 2007. “Using Ant Colony Optimization to Solve Hybrid Flow Shop Scheduling Problems.” The International Journal of Advanced Manufacturing Technology 35 (5–6): 541–550.
   Web of Science ®Google Scholar
• Aneja, Y. P., and H. Kamoun. 1999. “Scheduling of Parts and Robot Activities in a Two Machine Robotic Cell.” Computers and Operations Research 26: 297–312.
   Web of Science ®Google Scholar
• Batur, G. D., O. E. Karasan, and M. S. Akturk. 2012. “Multiple Part-Type Scheduling in Flexible Roboticcells.” International Journal of Production Research 135 (2): 726–740.
   Web of Science ®Google Scholar
• Bilge, U., and G. Ulusoy. 1995. “A Time Window Approach to Simultaneous Scheduling of Machines and Material Handling System in an FMS.” Operations Research 43 (6): 1058–1070.
   Web of Science ®Google Scholar
• Carlier, J., M. Haouari, M. Kharbeche, and A. Moukrim. 2010. “An Optimization-Based Heuristic for the Robotic Cell Problem.” European Journal of Operational Research 202: 636–645.
   Web of Science ®Google Scholar
• Chen, H., C. Chu, and J. M. Proth. 1997. “Sequencing of Parts in Robotic Cells.” International Journal of Flexible Manufacturing Systems 9: 81–104.
   Google Scholar
• Chen, L., N. Bostel, P. Dejax, J. C. Cai, and L. F. Xi. 2007. “A Tabu Search Algorithm for the Integrated Scheduling Problem of Container Handling Systems in a Maritime Terminal.” European Journal of Operational Research 181 (1): 40–58.
   Web of Science ®Google Scholar
• Chen, L., L. F. Xi, J. G. Cai, N. Bostel, and P. Dejax. 2006. “An Integrated Approach for Modeling and Solving the Scheduling Problem of Container Handling Systems.” Journal of Zhejiang University Science 7 (2): 234–239.
   Google Scholar
• Dawande, M., H. N. Geismar, S. P. Sethi, and C. Sriskandarajah. 2007. Throughput Optimization in Robotic Cells. New York: Springer.
   Google Scholar
• Dawande, M. W., H. N. Geismar, S. P. Sethi, and C. Sriskandarajah. 2005. “Sequencing and Scheduling in Robotic Cells: Recent Developments.” Journal of Scheduling 8: 387–426.
   Web of Science ®Google Scholar
• Elmi, A., M. Solimanpur, S. Topaloglu, and A. Elmi. 2012. “A Simulated Annealing Algorithm for the Job Shop Cell Scheduling Problem with Intercellular Moves and Reentrant Parts.” Computers and Industrial Engineering 61 (1): 171–178.
   Web of Science ®Google Scholar
• FazelZarandi, M. H., H. Mosadegh, and M. Fattahi. 2013. “Two-Machine Robotic Cell Scheduling Problem with Sequence- Dependent Setup Times.” Computers and Operations Research 40: 1420–1434.
   Web of Science ®Google Scholar
• Foumani, M., and K. Jenab. 2012. “Analysis of Flexible Robotic Cells with Improved Pure Cycle.” International Journal of Computer Integrated Manufacturing 26 (3): 201–215.
   Web of Science ®Google Scholar
• Geismar, H. N., M. Dawande, and C. Sriskandarajah. 2004. “Robotic Cells with Parallel Machines: Throughput Maximization in Constant Travel-Time Cells.” Journal of Scheduling 7 (5): 375–395.
   Web of Science ®Google Scholar
• Geismar, H. N., M. Dawande, and C. Sriskandarajah. 2006. “Throughput Optimization in Constant Travel-Time Dual-Gripper Robotic Cells with Parallel Machines.” Production and Operation Management 15 (2): 311–328.
   Web of Science ®Google Scholar
• Geismar, H. N., M. Pinedo, and C. Sriskandarajah. 2008. “Robotic Cells with Parallel Machines and Multiple Dual Gripper Robots: A Comparative Overview.” IIE Transactions 40: 1211–1227.
   Web of Science ®Google Scholar
• Glover, F., and M. Laguna. 1997. Tabu Search. Dordrecht: Kluwer Academic.
   Google Scholar
• Grabowski, J., and M. Wodecki. 2004. “A Very Fast Tabu Search Algorithm for the Permutation Flow Shop Problem with Makespan Criterion.” Computers and Operations Research 31 (11): 1891–1909.
   Web of Science ®Google Scholar
• Hall, N. G., H. Kamoun, and C. Sriskandarajah. 1998. “Scheduling in Robotic Cells: Complexity and Steady State Analysis.” European Journal of Operational Research 109: 43–65.
   Web of Science ®Google Scholar
• Hall, N. G., and C. Sriskandarajah. 1996. “A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process.” Operations Research 44 (3): 510–525.
   Web of Science ®Google Scholar
• Hurink, J., and S. Knust. 2001. “Makespan Minimization for Flow-Shop Problems with Transportation Times and a Single Robot.” Discrete Applied Mathematics 112: 199–216.
   Web of Science ®Google Scholar
• Hurink, J., and S. Knust. 2002. “A Tabu Search Algorithm for Scheduling a Single Robot in a Job-Shop Environment.” Discrete Applied Mathematics 119 (1–2): 181–203.
   Web of Science ®Google Scholar
• Jin, Z., Z. Yang, and T. Ito. 2006. “Metaheuristic Algorithms for the Multistage Hybrid Flowshop Scheduling Problem.” International Journal of Production Economics 100 (2): 322–334.
   Web of Science ®Google Scholar
• Jin, Z. H., K. Ohno, T. Ito, and S. E. Elmaghraby. 2002. “Scheduling Hybrid Flowshops in Printed Circuit Board Assembly Lines.” Production and Operations Management 11 (2): 216–230.
   Web of Science ®Google Scholar
• Kharbeche, M., J. Carlier, M. Haouari, and A. Moukrim. 2010. “Exact Method for Robotic Cell Problem.” Electronic Notes in Discrete Mathematics 36: 859–866.
   Google Scholar
• Kirkpatrick, S., C. D. Gelatt, and M. P. Vecchi. 1983. “Optimization by Simulated Annealing.” Science 220 (4598): 671–680.
   PubMed Web of Science ®Google Scholar
• Liu, B., L. Wang, and Y. H. Jin. 2008. “An Effective Hybrid PSO-Based Algorithm for Flow Shop Scheduling with Limited Buffers.” Computers and Operations Research 35 (9): 2791–2806.
   Web of Science ®Google Scholar
• Metropolis, N., A. W. Rosenbluth, A. H. Teller, and E. Teller. 1953. “Equation of State Calculation by East Computing Machines.” Journal of Chemical Physics 21: 1087–1091.
   Web of Science ®Google Scholar
• Nawaz, M., E. E. Enscore Jr, and I. Ham. 1983. “A Heuristic Algorithm for the m-Machine, n-Job Flow-Shop Sequencing Problem.” OMEGA – The International Journal of Management Science 11 (1): 91–95.
   Web of Science ®Google Scholar
• Nowicki, E., and C. Smutnicki. 2005. “An Advanced Tabu Search Algorithm for the Job Shop Problem.” Journal of Scheduling 8: 145–159.
   Web of Science ®Google Scholar
• Pinedo, M. 2002. Scheduling: Theory, Algorithms, and Systems. Englewood Cliffs, NJ: Prentice Hall.
   Google Scholar
• Ribas, I., R. Leisten, and J. M. Framiñan. 2010. “Review and Classification of Hybrid Flow Shop Scheduling Problems from a Production System and a Solutions Procedure Perspective.” Computers and Operations Research 37 (8): 1439–1454.
   Web of Science ®Google Scholar
• Ruiz, R., and J. A. Vázquez-Rodríguez. 2010. “The Hybrid Flow Shop Scheduling Problem.” European Journal of Operational Research 205 (1): 1–18.
   Web of Science ®Google Scholar
• Sarkheil, N., and K. Jenab. 2012. “On the Optimality of 1-Unit Cycles in Flow-Shop Networks.” International Journal of Production Research 50 (10): 2705–2709.
   Web of Science ®Google Scholar
• Sethi, S. P., C. Sriskandarajah, G. Sorger, J. Blazewicz, and W. Kubiak. 1992. “Sequencing of Parts and Robot Moves in a Robotic Cell.” International Journal of Flexible Manufacturing Systems 4: 331–358.
   Google Scholar
• Shafiei-Monfared, A., K. Salehi-Gilani, and K. Jenab. 2009. “Productivity Analysis in a Robotic Cell.” International Journal of Production Research 47 (23): 6651–6662.
   Web of Science ®Google Scholar
• Solimanpur, M., P. Vrat, and R. Shankar. 2004. “A Neuro-Tabu Search Heuristic for the Flow Shop Scheduling Problem.” Computers and Operations Research 31 (13): 2151–2164.
   Web of Science ®Google Scholar
• Soukhal, A., and P. Martineau. 2005. “Resolution of a Scheduling Problem in a Flow Shop Robotic Cell.” European Journal of Operational Research 161 (1): 62–72.
   Web of Science ®Google Scholar
• Soukhal, A., A. Oulamara, and P. Martineau. 2005. “Complexity of Flowshop Scheduling Problems With Transportation Constraints.” European Journal of Operational Research 161 (1): 32–41.
   Web of Science ®Google Scholar
• Sriskandarajah, C., N. G. Hall, and H. Kamoun. 1998. “Scheduling Large Robotic Cells without Buffers.” Annals of Operations Research 76: 287–321.
   Web of Science ®Google Scholar
• Tsubone, H., M. Ohba, H. Takamuki, and Y. Miyake. 1993. “A Production Scheduling System for a Hybrid Flow-Shop: A Case-Study.” Omega-International Journal of Management Science 21 (2): 205–214.
   Web of Science ®Google Scholar
• Zahrouni, W., and H. Kamoun. 2012. “Sequencing and Scheduling in a Three-Machine Robotic Cell.” International Journal of Production Research 50 (10): 2823–2835.
   Web of Science ®Google Scholar
• Zhang, C. Y., P. G. Li, Y. Q. Rao, and Z. L. Guan. 2008. “A Very Fast TS/SA Algorithm for the Job Shop Scheduling Problem.” Computers and Operations Research 35 (1): 282–294.
   Web of Science ®Google Scholar
• Zhang, R., and C. Wu. 2011. “A Simulated Annealing Algorithm Based on Block Properties for the Jobshop Scheduling Problem with Total Weighted Tardiness Objective.” Computers and Operations Research 38 (5): 854–867.
   Web of Science ®Google Scholar