Sequencing and scheduling in a three-machine robotic cell

International Journal of Production Research

Volumn 50, Issue 10, 2012, Pages 2823-2835

  Zahrouni, Wassim ^a   Kamoun, Hichem ^a  

^a UNIVERSITY OF SFAX   (Tunisia)

Author keywords

Blocking flowshop; Cyclic scheduling; Robotic cells; Sequencing

Indexed keywords

EID: 84880232795     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2011.596999     Document Type: Article

References (48)

1. Agnetis, A., 2000. Scheduling no-wait robotic cells with two and three machines. European Journal of Operational Research, 123 (2), 303-314.
2. Agnetis, A. and Pacciarelli, D., 2000. Part sequencing in three machine no-wait robotic cells. Operations Research Letters, 27 (4), 185-192.
3. Akcalt, E., Nemoto, K., and Uzsoy, R., 2001. Cycle-time improvements for photolithography process in semiconductor manufacturing. IEEE Transactions on Semiconductor Manufacturing, 14 (1), 48-56.
4. Aneja, Y.P. and Kamoun, H., 1999. Scheduling of parts and robot activities in two-machine robotic cell. Computers & Operations Research, 26 (4), 297-312.
5. Brauner, N. and Finke, G., (1997). Final results on the one-cycle conjecture in robotic cells. Internal note, Laboratoire LEIBNIZ, Institut IMAG, Grenoble, France.
6. Brauner, N. and Finke, G., 1999. On a conjecture in robotic cells: new simplified proof for the three-machine case. INFOR, 37 (1), 20-36.
7. Che, A., Chu, C., and Chu, F., 2002. Multicyclic hoist scheduling with constant processing times. IEEE Transactions on Robotics and Automation, 18 (1), 69-80.
8. Che, A., Chu, C., and Levner, E., 2003. A polynomial algorithm for 2-degree cyclic robot scheduling. European Journal of Operational Research, 145 (14), 31-44.
9. Chen, H., Chu, C., and Proth, J., 1998. Cyclic scheduling with time window constraints. IEEE Transactions on Robotics and Automation, 14 (1), 144-152.
10. Crama, Y., et al., 2000. Cyclic scheduling in robotic flowshops. Annals of Operations Research: Mathematics of Industrial Systems, 96 (1-4), 97-124.
11. Crama, Y. and van de Klundert, J., 1997. Cyclic scheduling of identical parts in a robotic cell. Operations Research, 45 (6), 952-965.
12. Crama, Y. and van de Klundert, J., 1999. Cyclic scheduling in 3-machine robotic flow shops. Journal of Scheduling, 2 (1), 35-54.
13. Dawande, M., et al., 2005. Sequencing and scheduling in robotic cells: recent developments. Journal of Scheduling, 8 (5), 387-426.
14. Dawande, M., et al., 2007. Throughput optimization in robotic cells. New York: Springer.
15. Dawande, M., Sriskandarajah, C., and Sethi, S., 2002. On throughput maximization in constant travel-time robotic cells. Manufacturing and Service Operations Management, 4 (4), 296-312.
16. Geismar, H.N., Sriskandarajah, C., and Ramanan, N., 2004. Increasing throughput for robotic cells with parallel machines and multiple robots. IEEE Transactions on Automation Science & Engineering, 1 (1), 84-89.
17. Grabowski, J. and Pempera, J., 2007. The permutation flowshop problem with blocking. A tabu search approach. Omega, 35 (3), 302-311.
18. Graves, S.C., et al., 1983. Scheduling of re-entrant flow shops. Journal of Operations Management, 3 (4), 197-207.
19. Gultekin, H., Karasan, O.E. and Akturk, M.S., 2009. Pure cycles in flexible robotic cells. Computers & Operations Research, 36 (2), 329-343.
20. Hall, N.G., 1999. Operations research techniques for robotic systems. In: S.Y. Nof, ed. Handbook of industrial robotics, second edition. Canada: John Wiley and Sons, 543-578.
21. Hall, N.G., Kamoun, H., and Sriskandarajah, C., 1997. Scheduling in robotic cells: classification, two and three machine cells. Operations Research, 45 (3), 421-439.
22. Hall, N.G., Kamoun, H., and Sriskandarajah, C., 1998. Scheduling in robotic cells: complexity and steady state analysis. European Journal of Operational Research, 109 (1), 43-63.
23. Hall, N.G. and Sriskandarajah, C., 1996. A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44 (3), 510-525.
24. Ioachim, I. and Soumis, F., 1995. Schedule efficiency in a robotic production cell. International Journal of Flexible Manufacturing Systems, 7 (1), 5-26.
25. Kamoun, H., Hall, N.G., and Sriskandarajah, C., 1999. Scheduling in robotic cells: heuristics and cell design. Operations Research, 47 (6), 821-83.
26. Karabati, S. and Kouvelis, P., 1996. Cyclic scheduling in flow lines: modelling, observations, effective heuristics and a cycle time minimization procedure. Naval Research Logistics, 43 (2), 211-231.
27. Kats, V., Levner, E., and Meyzin, L., 1999. Multiple-part cyclic hoist scheduling using a sieve method. IEEE Transactions on Robotics and Automation, 15 (4), 704-713.
28. Kats, V. and Levner, E., 2002. Cyclic scheduling in a robotic production line. Journal of Scheduling, 5 (1), 23-41.
29. Kouvelis, P. and Karabati, S., 1999. Cyclic scheduling in synchronous production lines. IIE Transactions, 31 (8), 709-719.
30. Kumar, S., Ramanan, N., and Sriskandarajah, C., 2005. Minimizing cycle time in large robotic cells. IIE Transactions, 37 (2), 123-136.
31. Lee, J. and Korbaa, O., 2004. Modelling and scheduling of ratio-driven FMS using unfolding time Petri nets. Computers & Industrial Engineering, 46 (4), 639-653.
32. Lee, T.E. and Posner, M.E., 1997. Performance measures and schedules in periodic jobshops. Operations Research, 45 (1), 72-91.
33. Lei, L. and Liu, Q., 2001. Optimal Cyclic Scheduling of a robotic processing line with two-product and time-window constraints. INFOR, 39 (2), 185-199.
34. Lei, L. and Wang, T.J., 1994. Determining optimal cyclic hoist schedules in a single-hoist electroplating line. IIE Transactions, 26 (2), 25-33.
35. Leung, J.M.Y., et al., 2004. Optimal cyclic multi-hoist scheduling: a mixed integer programming approach. Operations Research, 52 (6), 965-976.
36. Levner, E., Kats, V., and Levit, V., 1997. An improved algorithm for cyclic flowshop scheduling in a robotic cell. European Journal of Operational Research, 97 (3), 500-508.
37. Liu, J., Jiang, J., and Zhou, Z., 2002. Cyclic scheduling of a single hoist in extended electroplating lines: a comprehensive integer programming solution. IIE Transactions, 34 (10), 905-914.
38. Nawaz, M., Enscore, E.E., and Ham, I., 1983. A heuristic algorithm for the m-Machine, n-Job flow-shop sequencing problem. OMEGA, 11 (1), 91-95.
39. Perkinson, T., Gyurcsik, R., and McLarty, P., 1996. Single-wafer cluster tool performance: an analysis of the effects of redundant chambers and revisitation sequences on throughput. IEEE Transactions on Semiconductor Manufacturing, 9 (3), 384-400.
40. Perkinson, T., et al., 1994. Single-wafer cluster tool performance: an analysis of throughput. IEEE Transactions on Semiconductor Manufacturing, 7 (3), 369-373.
41. Ronconi, D.P., 2004. A note on constructive heuristics for the flowshop problem with blocking. International journal of Production Economics, 87 (1), 39-48.
42. Sethi, S.P., et al., 1992. Sequencing of parts and robot moves in a robotic cell. International Journal of Flexible Manufacturing Systems, 4 (3-4), 331-358.
43. Song, J.S. and Lee, T.E., 1998. Petri net modeling and scheduling for cyclic job shops with blocking. Computers and Industrial Engineering, 34 (2), 281-295.
44. Song, W., Zabinsky, Z.B., and Storch, R.L., 1993. An algorithm for scheduling a chemical processing tank line. Production Planning and Control, 4 (4), 323-332.
45. Venkatesh, S., et al., 1997. A steady-state throughput analysis of cluster tools: dual-blade versus single-blade robots. IEEE Transactions on Semiconductor Manufacturing, 10 (4), 418-424.
46. Wood, S., 1996. Simple Performance models for integrated processing tools. IEEE Transactions on Semiconductor Manufacturing, 9 (3), 320-328.
47. Yan, P., et al., 2010. A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows. International Journal of Production Research, 48 (21), 6461-6480.
48. Yildiz, S., Akturk, M.S., and Karasan, O.E., 2011. Bicriteria robotic cell scheduling with controllable processing times. International Journal of Production Research, 49 (2), 569-583.