메뉴 건너뛰기




Volumn 19, Issue 3, 2003, Pages 480-484

Optimal cyclic scheduling for printed circuit board production lines with multiple hoists and general processing sequence

Author keywords

Cyclic schedules; Holst scheduling; Mixed integer programming; Printed circuit board (PCB) manufacturing

Indexed keywords

BENCHMARKING; COMPUTATIONAL METHODS; HOISTS; INTEGER PROGRAMMING; SCHEDULING;

EID: 0037524472     PISSN: 1042296X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TRA.2003.810240     Document Type: Article
Times cited : (50)

References (20)
  • 1
    • 0016962332 scopus 로고
    • Mathematical programming solution of a hoist scheduling program
    • L. W. Phillips and P. S. Linger, "Mathematical programming solution of a hoist scheduling program," AIIE Trans., vol. 8, no. 2, pp. 219-225, 1976.
    • (1976) AIIE Trans. , vol.8 , Issue.2 , pp. 219-225
    • Phillips, L.W.1    Linger, P.S.2
  • 2
    • 0024029390 scopus 로고
    • Hoist scheduling for a PCB electroplating facility
    • G. W. Shapiro and H. L. W. Nuttle, "Hoist scheduling for a PCB electroplating facility," IIE Trans., vol. 20, no. 2, pp. 157-167, 1988.
    • (1988) IIE Trans. , vol.20 , Issue.2 , pp. 157-167
    • Shapiro, G.W.1    Nuttle, H.L.W.2
  • 3
    • 0028396353 scopus 로고
    • Determining optimal cyclic hoist schedules in a single-hoist electroplating line
    • L. Lei and T. J. Wang, "Determining optimal cyclic hoist schedules in a single-hoist electroplating line," IIE Trans., vol. 26, no. 2, pp. 25-33, 1994.
    • (1994) IIE Trans. , vol.26 , Issue.2 , pp. 25-33
    • Lei, L.1    Wang, T.J.2
  • 4
    • 0032000755 scopus 로고    scopus 로고
    • Cyclic scheduling of a hoist with time window constraints
    • Feb.
    • H. Chen, C. Chu, and J.-M. Proth, "Cyclic scheduling of a hoist with time window constraints," IEEE Trans. Robot. Automat., vol. 14, pp. 144-152, Feb. 1998.
    • (1998) IEEE Trans. Robot. Automat. , vol.14 , pp. 144-152
    • Chen, H.1    Chu, C.2    Proth, J.-M.3
  • 5
    • 0026976853 scopus 로고
    • Hoist scheduling problem: An approach based on constraints logic programming
    • Nice, France
    • P. Baptiste, B. Legeard, and C. Varnier, "Hoist scheduling problem: An approach based on constraints logic programming," in Proc. IEEE Int. Conf. Robotics and Automation, vol. 2, Nice, France, 1992, pp. 1139-1144.
    • (1992) Proc. IEEE Int. Conf. Robotics and Automation , vol.2 , pp. 1139-1144
    • Baptiste, P.1    Legeard, B.2    Varnier, C.3
  • 6
    • 0009166239 scopus 로고    scopus 로고
    • Robotic flowshop scheduling is strongly NP-complete
    • W. K. Klein Haneveld et al., Eds. CWI tract 122, Amsterdam
    • Y. Crama and J. van de Klundert, "Robotic flowshop scheduling is strongly NP-complete," in Ten Years LNMB, W. K. Klein Haneveld et al., Eds. CWI tract 122, Amsterdam, 1997, pp. 277-286.
    • (1997) Ten Years LNMB , pp. 277-286
    • Crama, Y.1    Van de Klundert, J.2
  • 7
    • 0038699095 scopus 로고
    • A proof: The cyclic hoist scheduling problem is NP-complete
    • Rutgers Univ., New Brunswick, NJ
    • L. Lei and T. J. Wang, "A proof: The cyclic hoist scheduling problem is NP-complete," Rutgers Univ., New Brunswick, NJ, Working Paper 89-0016, 1989.
    • (1989) Working Paper , vol.89 , Issue.16
    • Lei, L.1    Wang, T.J.2
  • 8
    • 0031540827 scopus 로고    scopus 로고
    • Minimizing the number of robots to meet a given cyclic schedule
    • V. Kats and E. Levner, "Minimizing the number of robots to meet a given cyclic schedule," Ann. Oper. Res., vol. 69, pp. 209-226, 1997.
    • (1997) Ann. Oper. Res. , vol.69 , pp. 209-226
    • Kats, V.1    Levner, E.2
  • 9
    • 0032045058 scopus 로고    scopus 로고
    • Cyclic scheduling of operations for apart type in an FMS handled by a single robot: A parametric critical-path approach
    • _, "Cyclic scheduling of operations for apart type in an FMS handled by a single robot: A parametric critical-path approach," Int. J. Flexible Manuf. Syst., vol. 10, pp, 129-138, 1998.
    • (1998) Int. J. Flexible Manuf. Syst. , vol.10 , pp. 129-138
  • 10
    • 0038699094 scopus 로고    scopus 로고
    • Polynomial algorithms for scheduling of robots
    • E. Levner, Ed. Holon, Israel: CTEH Press
    • _, "Polynomial algorithms for scheduling of robots," in Intelligent Scheduling of Robots and Flexible Manufacturing Systems, E. Levner, Ed. Holon, Israel: CTEH Press, 1996, pp. 77-100.
    • (1996) Intelligent Scheduling of Robots and Flexible Manufacturing Systems , pp. 77-100
  • 11
    • 0013188060 scopus 로고    scopus 로고
    • A geometric algorithm for finding two-unit cyclic schedules in a no-wait robotic flowshop
    • E. Levner, Ed. Holon, Israel: CTEH Press
    • E. Levner, V. Kats, and C. Sriskandarajah, "A geometric algorithm for finding two-unit cyclic schedules in a no-wait robotic flowshop," in Intelligent Scheduling of Robots and Flexible Manufacturing Systems, E. Levner, Ed. Holon, Israel: CTEH Press, 1996, pp. 101-112.
    • (1996) Intelligent Scheduling of Robots and Flexible Manufacturing Systems , pp. 101-112
    • Levner, E.1    Kats, V.2    Sriskandarajah, C.3
  • 12
    • 84877343203 scopus 로고
    • An algorithm for scheduling a chemical processing tank line
    • W. Song, Z. Zabinsky, and R. Storch, "An algorithm for scheduling a chemical processing tank line," Prod. Planning Contr., vol. 4, no. 4, pp. 323-332, 1993.
    • (1993) Prod. Planning Contr. , vol.4 , Issue.4 , pp. 323-332
    • Song, W.1    Zabinsky, Z.2    Storch, R.3
  • 13
    • 0000402860 scopus 로고
    • The minimum common-cycle algorithm for cyclic scheduling of two material handling hoists with time windows constraints
    • L. Lei and T. J. Wang, "The minimum common-cycle algorithm for cyclic scheduling of two material handling hoists with time windows constraints," Manage. Sci., vol. 37, pp. 1629-1639, 1991.
    • (1991) Manage. Sci. , vol.37 , pp. 1629-1639
    • Lei, L.1    Wang, T.J.2
  • 15
    • 2442517409 scopus 로고
    • An exact optimal cyclic scheduling algorithm for multi-operator service of a production line
    • V. Kats, "An exact optimal cyclic scheduling algorithm for multi-operator service of a production line," Automat. Remote Contr., vol. 42, no. 4II, pp. 538-543, 1982.
    • (1982) Automat. Remote Contr. , vol.42 , Issue.4 II , pp. 538-543
    • Kats, V.1
  • 17
    • 0009165903 scopus 로고    scopus 로고
    • Optimal cyclic multi-hoist scheduling: A mixed integer programming approach
    • Syst. Eng., Eng. Manage. Dept., Chinese Univ. of Hong Kong, Hong Kong
    • J. Leung, G. Zhang, X. Yang, R. Mak, and K. Lam, "Optimal cyclic multi-hoist scheduling: A mixed integer programming approach," Syst. Eng., Eng. Manage. Dept., Chinese Univ. of Hong Kong, Hong Kong, Tech. Rep. SEEM2000-06, 2000.
    • (2000) Tech. Rep. , vol.SEEM2000-06
    • Leung, J.1    Zhang, G.2    Yang, X.3    Mak, R.4    Lam, K.5
  • 18
    • 0009090861 scopus 로고    scopus 로고
    • The hoist scheduling problem for no-wait production lines - A survey of research
    • Syst. Eng., Eng. Manage. Dept., Chinese Univ. of Hong Kong, Hong Kong
    • R. Mak, Y. Wong, J. M. Y. Leung, K. Lam, and S. M. Gupta, "The hoist scheduling problem for no-wait production lines - A survey of research," Syst. Eng., Eng. Manage. Dept., Chinese Univ. of Hong Kong, Hong Kong, Tech. Rep. SEEM2000-05, 2000.
    • (2000) Tech. Rep. , vol.SEEM2000-05
    • Mak, R.1    Wong, Y.2    Leung, J.M.Y.3    Lam, K.4    Gupta, S.M.5
  • 20
    • 25544435222 scopus 로고    scopus 로고
    • Optimal simple cyclic scheduling for printed circuit board production lines with multiple hoists and generic tank placement
    • Syst. Eng., Eng. Manage. Dept., Chinese Univ. of Hong Kong, Hong Kong
    • J. Leung and G. Zhang, "Optimal simple cyclic scheduling for printed circuit board production lines with multiple hoists and generic tank placement," Syst. Eng., Eng. Manage. Dept., Chinese Univ. of Hong Kong, Hong Kong, Tech. Rep. SEEM2001-07, 2001.
    • (2001) Tech. Rep. , vol.SEEM2001-07
    • Leung, J.1    Zhang, G.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.