Multiple part-type production in robotic cells: equivalence of two real-world models

Manufacturing and Service Operations Management

Volumn 11, Issue 2, 2009, Pages 210-228

  Dawande, Milind ^a   Pinedo, Michael ^b   Sriskandarajah, Chelliah ^a  

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

Computational complexity; Cyclic production; Dual gripper cells; Output buffers; Robotic cells

Indexed keywords

CONTROL MECHANISM; CYCLIC PRODUCTION; CYCLIC SCHEDULES; CYCLIC SOLUTIONS; DOMINATING CYCLES; DUAL GRIPPERS; DUAL-GRIPPER CELLS; MAXIMUM THROUGH-PUT; MULTIPLE PARTS; ONE-TO-ONE MAPPINGS; OPERATIONS MANAGERS; OUTPUT BUFFER; OUTPUT BUFFERS; REAL-WORLD; ROBOTIC CELL; ROBOTIC CELLS; THROUGHPUT MAXIMIZATION PROBLEM; TOTAL COSTS;

CELL MEMBRANES; COMPUTATIONAL COMPLEXITY; GRIPPERS; MARKING MACHINES; ROBOT PROGRAMMING; ROBOTICS; THROUGHPUT;

CYTOLOGY;

EID: 67649992224     PISSN: 15234614     EISSN: 15265498     Source Type: Journal    
DOI: 10.1287/msom.1070.0208     Document Type: Article

References (51)

1. Agnetis, A. 2000. Scheduling no-wait robotic cells with two and three machines. Eur. J. Oper. Res. 123 303-314.
2. Akçali, E., K. Nemoto, R. Uzsoy. 2001. Cycle-time improvements for photolithography process in semiconductor manufacturing. IEEE Trans. Semiconductor Manufacturing 14 48-56.
3. Aneja, Y. P., H. Kamoun. 1999. Scheduling of parts and robot activities in a two-machine robotic cell. Comput. Oper. Res. 26 297-312.
4. Asfahl, C. R. 1992. Robots and Manufacturing Automation. John Wiley and Sons, New York.
5. Brauner, N., G. Finke, C. Gueguen. 1997. Optimal cyclic production in robotic flow shops with buffer. Technical Report RR982-I, Laboratoire LEIBNIZ, Institut IMAG, Grenoble, France.
6. Che, A., C. Chu, F. Chu. 2002. Multicyclic hoist scheduling with constant processing times. IEEE Trans. Robotics Automation 18 69-80.
7. Che, A., C. Chu, E. Levner. 2003. A polynomial algorithm for 2-degree cyclic robot scheduling. Eur. J. Oper. Res. 145 31-44.
8. Chen, H., C. Chu, J. Proth. 1998. Cyclic scheduling with time window constraints. IEEE Trans. Robotics Automation 14 144-152.
9. Crama, Y., J. van de Klundert. 1997. Cyclic scheduling of identical parts in a robotic cell. Oper. Res. 45 952-965.
10. Crama, Y., V. Kats, J. van de Klundert, E. Levner. 2000. Cyclic scheduling in robotic flowshops. Ann. Oper. Res.: Math. Indust. Systems 96 97-124.
11. Dawande, M., C. Sriskandarajah, S. P. Sethi. 2002. Throughput optimization in constant travel-time robotic cells. Manufacturing Service Oper. Management 4 296-312.
12. Dawande, M., H. N. Geismar, S. P. Sethi, C. Sriskandarajah. 2005. Sequencing and scheduling in robotic cells: Recent developments. J. Scheduling 8 387-426.
13. Dawande, M., H. N. Geismar, S. P. Sethi, C. Sriskandarajah. 2007. Throughput Optimization in Robotic Cells. Springer, New York.
14. Drobouchevitch, I. G., S. P. Sethi, C. Sriskandarajah. 2006. Scheduling a dual gripper robot cell: One-unit cycles. Eur. J. Oper. Res. 171 598-631.
15. Drobouchevitch, I. G., S. P. Sethi, J. B. Sidney, C. Sriskandarajah. 2004. Scheduling multiple parts in two-machine dual gripper robot cells: Heuristic algorithm and performance guarantee. Internat. J. Oper. Quant. Management 10 297-314.
16. Garey, M. R., D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco.
17. Geismar, H. N., M. Dawande, C. Sriskandarajah. 2006. Throughput optimization in constant travel-time dual gripper robotic cells with parallel machines. Production Oper. Management 15 311-328.
18. Geismar, H. N., C. Sriskandarajah, N. Ramanan. 2004. Increasing throughput for robotic cells with parallel machines and multiple robots. IEEE Trans. Automation Sci. Engrg. 1 84-89.
19. Geismar, H. N., L. M. A. Chan, M. Dawande, C. Sriskandarajah. 2008. Approximations to optimal k-unit cycles for singlegripper and dual-gripper robotic cells. Production Oper. Management. 17 (5) 551-563.
20. Gilmore, P. C., R. E. Gomory. 1964. Sequencing a one state-variable machine: A solvable case of the traveling salesman problem. Oper. Res. 12 655-679.
21. Graham, R. L., E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan. 1979. Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discrete Math. 5 287-326.
22. Hall, N. G. 1999. Operations research techniques for robotic systems. S. Y. Nof, ed. Operations Research Techniques for Robotic Systems. Handbookof Industrial Robotics, Vol. II. John Wiley, New York, 543-577.
23. Hall, N. G., H. Kamoun, C. Sriskandarajah. 1997. Scheduling in robotic cells: Classification, two and three machine cells. Oper. Res. 45 421-439.
24. Hall, N. G., H. Kamoun, C. Sriskandarajah. 1998. Scheduling in robotic cells: Complexity and steady state analysis. Eur. J. Oper. Res. 109 43-63.
25. Kamoun, H., N. G. Hall, C. Sriskandarajah. 1999. Scheduling in robotic cells: Heuristics and cell design. Oper. Res. 47 821-835.
26. Kats, V., E. Levner. 2002. Cycle scheduling in a robotic production line. J. Scheduling 5 23-41.
27. Kats, V., E. Levner, L. Meyzin. 1999. Multiple-part cyclic hoist scheduling using a sieve method. IEEE Trans. Robotics Automation 15 704-713.
28. Kumar, S., N. Ramanan, C. Sriskandarajah. 2005. Minimizing cycle time in large robotic cells. IIE Trans. 37 123-136.
29. Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys, eds. 1985. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley & Sons, Chichester.
30. Lei, L., T.-J. Wang. 1994. Determining optimal cyclic hoist schedules in a single-hoist electroplating line. IIE Trans. 26 25-33.
31. Leung, J. M. Y., G. Zhang, X. Yang, R. Mak, K. Lam. 2004. Optimal cyclic multi-hoist scheduling: A mixed integer programming approach. Oper. Res. 52 965-976.
32. Levner, E., V. Kats, V. E. Levit. 1997. An improved algorithm for cyclic robotic flowshop scheduling in a robotic cell. Eur. J. Oper. Res. 97 500-508.
33. Liu, J., J. Jiang, Z. Zhou. 2002. Cyclic scheduling of a single hoist in extended electroplating lines: A comprehensive integer programming solution. IIE Trans. 34 905-914.
34. Miller, R. K., T. C. Walker. 1990. FMS/CIM Systems Integration Handbook. The Fairmont Press, Lilburn, GA.
35. Perkinson, T., R. Gyurcsik, P. McLarty. 1996. Single-wafer cluster tool performance: An analysis of the effects of redundant chambers and revisitation sequences on throughput. IEEE Trans. Semiconductor Manufacturing 9 384-400.
36. Perkinson, T., P. McLarty, R. Gyurcsik, R. Cavin. 1994. Single-wafer cluster tool performance: An analysis of throughput. IEEE Trans. Semiconductor Manufacturing 7 369-373.
37. Phillips, L. W., P. S. Unger. 1976. Mathematical programming solution of hoist scheduling problem. AIIE Trans. 8 219-225.
38. Pinedo, M. 2002. Scheduling: Theory, Algorithms, and Systems. Prentice Hall, Englewood Cliffs, NJ.
39. Ramanan, N. 2002, 2004, 2007. Personal communication.
40. Robotic Industries Association. 2006. http://www.roboticsonline.com.
41. Sethi, S. P., J. B. Sidney, C. Sriskandarajah. 2001. Scheduling in dual gripper robotic cells for productivity gains. IEEE Trans. Robotics Automation 17 324-341.
42. Sethi, S. P., C. Sriskandarajah, G. Sorger, J. Blazewicz, W. Kubiak. 1992. Sequencing of parts and robot moves in a robotic cell. Internat. J. Flexible Manufacturing Systems 4 331-358.
43. Shapiro, G. W., H. W. Nuttle. 1988. Hoist scheduling for a PCB electroplating facility. IIE Trans. 20 157-167.
44. Song, W., Z. B. Zabinsky, R. L. Storch. 1993. An algorithm for scheduling a chemical processing tank line. Production Planning Control 4 323-332.
45. Sriskandarajah, C., N. G. Hall, H. Kamoun. 1998. Scheduling large robotic cells without buffers. Ann. Oper. Res. 76 287-321.
46. Sriskandarajah, C., I. G. Drobouchevitch, S. P. Sethi, R. Chandrasekaran. 2004. Scheduling multiple parts in a robotic cell served by a dual gripper robot. Oper. Res. 52 65-82.
47. Su, Q., F. F. Chen. 1996. Optimal sequencing of double-gripper gantry robot moves in tightly-coupled serial production systems. IEEE Trans. Robotics Automation 12 22-30.
48. Vairaktarakis, G. L. 2003. Simple algorithms for Gilmore-Gomory's traveling salesman and related problems. J. Scheduling 6 499-520.
49. Venkatesh, S., R. Davenport, P. Foxhoven, J. Nulman. 1997. A steady-state throughput analysis of cluster tools: Dual-blade versus single-blade robots. IEEE Trans. Semiconductor Manufacturing 10 418-424.
50. Wittrock, R. J. 1985. Scheduling algorithms for flexible flow lines. IBM J. Res. Development 29 401-412.
51. Wood, S. 1996. Simple performance models for integrated processing tools. IEEE Trans. Semiconductor Manufacturing 9 320-328.