메뉴 건너뛰기




Volumn 52, Issue 6, 2004, Pages 965-976

Optimal cyclic multi-hoist scheduling: A mixed integer programming approach

Author keywords

Industries: chemical, electric, hoist scheduling; Mixed integer programming: applications, formulation; Production scheduling: applications, cyclic scheduling

Indexed keywords

ALGORITHMS; BIOCHEMISTRY; CHEMICAL INDUSTRY; CHEMICAL LABORATORIES; ELECTRIC INDUSTRY; ELECTROPLATING; INTEGER PROGRAMMING; LIQUID CRYSTAL DISPLAYS; MATHEMATICAL MODELS; OPTIMIZATION; OXIDATION; PRINTED CIRCUIT BOARDS; PROBLEM SOLVING; PRODUCTION CONTROL; ROBOTICS;

EID: 12344318544     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.1040.0144     Document Type: Article
Times cited : (81)

References (34)
  • 1
    • 0028518445 scopus 로고
    • A bounding scheme for deriving the minimal cycle time of a single-transporter N-stage process with time-window constraints
    • Armstrong, R., L. Lei, S. Gu. 1994. A bounding scheme for deriving the minimal cycle time of a single-transporter N-stage process with time-window constraints. Eur. J. Oper. Res. 78 130-140.
    • (1994) Eur. J. Oper. Res. , vol.78 , pp. 130-140
    • Armstrong, R.1    Lei, L.2    Gu, S.3
  • 3
    • 0032000755 scopus 로고    scopus 로고
    • Cyclic scheduling of a hoist with time window constraints
    • Chen, H., C. Chu, J.-M. Proth. 1998. Cyclic scheduling of a hoist with time window constraints. IEEE Trans. Robotics Automation 14(1) 144-152.
    • (1998) IEEE Trans. Robotics Automation , vol.14 , Issue.1 , pp. 144-152
    • Chen, H.1    Chu, C.2    Proth, J.-M.3
  • 4
    • 0009166239 scopus 로고    scopus 로고
    • Robotic flowshop schedulin is strongly NP-complete
    • W. K. Klein Haneveld, O. J. Vrieze, L. C. M. Kallenberg, eds. CWI tract 122, Amsterdam, The Netherlands
    • Crama, Y., J. van de Klundert. 1997a. Robotic flowshop schedulin is strongly NP-complete. W. K. Klein Haneveld, O. J. Vrieze, L. C. M. Kallenberg, eds. Ten Years LNMB. CWI tract 122, Amsterdam, The Netherlands, 277-286.
    • (1997) Ten Years LNMB , pp. 277-286
    • Crama, Y.1    Van De Klundert, J.2
  • 5
    • 0031272146 scopus 로고    scopus 로고
    • Cyclic scheduling of identical parts in a robotic cell
    • Crama, Y., J. van de Klundert. 1997b. Cyclic scheduling of identical parts in a robotic cell. Oper. Res. 45(6) 952-965.
    • (1997) Oper. Res. , vol.45 , Issue.6 , pp. 952-965
    • Crama, Y.1    Van De Klundert, J.2
  • 7
    • 38249018161 scopus 로고
    • A necessary but insufficient condition for the stochastic binary choice problem
    • Gilboa, I. 1990. A necessary but insufficient condition for the stochastic binary choice problem. J. Math. Psych. 34 371-392.
    • (1990) J. Math. Psych. , vol.34 , pp. 371-392
    • Gilboa, I.1
  • 9
    • 0002868454 scopus 로고    scopus 로고
    • Scheduling in robotic cells: Complexity and steady state analysis
    • Hall, N. G., H. Kamoun, C. Sriskandarajah. 1998. Scheduling in robotic cells: Complexity and steady state analysis. Eur. J. Oper. Res. 109 43-65.
    • (1998) Eur. J. Oper. Res. , vol.109 , pp. 43-65
    • Hall, N.G.1    Kamoun, H.2    Sriskandarajah, C.3
  • 11
    • 0008912146 scopus 로고    scopus 로고
    • On a scheduling problem in a robotized analytical system
    • Hertz, A., Y. Mottet, Y. Rochat. 1996. On a scheduling problem in a robotized analytical system. Discrete Appl. Math. 65 285-318.
    • (1996) Discrete Appl. Math. , vol.65 , pp. 285-318
    • Hertz, A.1    Mottet, Y.2    Rochat, Y.3
  • 12
    • 2442517409 scopus 로고
    • An exact optimal cyclic scheduling algorithm for multioperator service of a production line
    • Kats, V. 1982. An exact optimal cyclic scheduling algorithm for multioperator service of a production line. Automat. Remote Control 42(4II) 538-543.
    • (1982) Automat. Remote Control , vol.42 , Issue.4 II , pp. 538-543
    • Kats, V.1
  • 13
    • 0038699094 scopus 로고    scopus 로고
    • Polynomial algorithms for scheduling of robots
    • E. Levner, ed. CTEH Press, Center for Technological Education, Holon, Israel
    • Kats, V., E. Levner. 1996. Polynomial algorithms for scheduling of robots. E. Levner, ed. Intelligent Scheduling of Robots and Flexible Manufacturing Systems. CTEH Press, Center for Technological Education, Holon, Israel, 77-100.
    • (1996) Intelligent Scheduling of Robots and Flexible Manufacturing Systems , pp. 77-100
    • Kats, V.1    Levner, E.2
  • 14
    • 0031540827 scopus 로고    scopus 로고
    • Minimizing the number of robots to meet a given cyclic schedule
    • Kats, V., E. Levner. 1997. Minimizing the number of robots to meet a given cyclic schedule. Ann. Oper. Res. 69 209-226.
    • (1997) Ann. Oper. Res. , vol.69 , pp. 209-226
    • Kats, V.1    Levner, E.2
  • 15
    • 0032045058 scopus 로고    scopus 로고
    • Cyclic scheduling of operations for a part type in an FMS handled by a single robot: A parametric critical-path approach
    • Kats, V., E. Levner. 1998. Cyclic scheduling of operations for a part type in an FMS handled by a single robot: A parametric critical-path approach. Internat. J. Flexible Manufacturing Systems 10 129-138.
    • (1998) Internat. J. Flexible Manufacturing Systems , vol.10 , pp. 129-138
    • Kats, V.1    Levner, E.2
  • 16
    • 0032646146 scopus 로고    scopus 로고
    • Multiple-part cyclic hoist scheduling using a sieve method
    • Kats, V., E. Levner, L. Meyzin. 1999. Multiple-part cyclic hoist scheduling using a sieve method. IEEE Trans. Robotics Automation 15(4) 704-713.
    • (1999) IEEE Trans. Robotics Automation , vol.15 , Issue.4 , pp. 704-713
    • Kats, V.1    Levner, E.2    Meyzin, L.3
  • 17
    • 0031492360 scopus 로고    scopus 로고
    • Current trends in deterministic scheduling
    • Lee, C.-Y., L. Lei, M. Pinedo. 1997. Current trends in deterministic scheduling. Ann. Oper. Res. 70 1-41.
    • (1997) Ann. Oper. Res. , vol.70 , pp. 1-41
    • Lee, C.-Y.1    Lei, L.2    Pinedo, M.3
  • 18
    • 0027684058 scopus 로고
    • Determining the optimal starting times in a cyclic schedule with a given route
    • Lei, L. 1993. Determining the optimal starting times in a cyclic schedule with a given route. Comput. Oper. Res. 20(8) 807-816.
    • (1993) Comput. Oper. Res. , vol.20 , Issue.8 , pp. 807-816
    • Lei, L.1
  • 19
    • 0038699095 scopus 로고
    • A proof: The cyclic hoist scheduling problem is NP-complete
    • Rutgers University, New Brunswick, NJ
    • Lei, L., T. J. Wang. 1989. A proof: The cyclic hoist scheduling problem is NP-complete. Working paper 89-0016, Rutgers University, New Brunswick, NJ.
    • (1989) Working Paper , vol.89 , Issue.16
    • Lei, L.1    Wang, T.J.2
  • 20
    • 0000402860 scopus 로고
    • The minimum common-cycle algorithm for cyclic scheduling of two material handling hoists with time windows constraints
    • Lei, L., T. J. Wang. 1991. The minimum common-cycle algorithm for cyclic scheduling of two material handling hoists with time windows constraints. Management Sci. 37 1629-1639.
    • (1991) Management Sci. , vol.37 , pp. 1629-1639
    • Lei, L.1    Wang, T.J.2
  • 21
    • 0028396353 scopus 로고
    • Determining optimal cyclic hoist schedules in a single-hoist electroplating line
    • Lei, L., T. J. Wang. 1994. Determining optimal cyclic hoist schedules in a single-hoist electroplating line. IIE Trans. 26(2) 25-33.
    • (1994) IIE Trans. , vol.26 , Issue.2 , pp. 25-33
    • Lei, L.1    Wang, T.J.2
  • 22
    • 0027663342 scopus 로고
    • Minimizing the fleet size with dependent time-window and single-track constraints
    • Lei, L., R. Armstrong, S. Gu. 1993. Minimizing the fleet size with dependent time-window and single-track constraints. Oper. Res. Lett. 14 91-98.
    • (1993) Oper. Res. Lett. , vol.14 , pp. 91-98
    • Lei, L.1    Armstrong, R.2    Gu, S.3
  • 23
    • 38149147249 scopus 로고
    • More facets from fences for linear ordering and acyclic subgraph polytopes
    • Leung, J., J. Lee. 1994. More facets from fences for linear ordering and acyclic subgraph polytopes. Discrete Appl. Math. 50 185-200.
    • (1994) Discrete Appl. Math. , vol.50 , pp. 185-200
    • Leung, J.1    Lee, J.2
  • 24
    • 0037524472 scopus 로고    scopus 로고
    • Optimal simple cyclic scheduling for printed circuit board production lines with multiple hoists and general processing sequence
    • Leung, J., G. Zhang, 2003. Optimal simple cyclic scheduling for printed circuit board production lines with multiple hoists and general processing sequence. IEEE Trans. Robotics Automation 19(3) 480-484.
    • (2003) IEEE Trans. Robotics Automation , vol.19 , Issue.3 , pp. 480-484
    • Leung, J.1    Zhang, G.2
  • 25
    • 0031095268 scopus 로고    scopus 로고
    • An improved algorithm for cyclic flowshop scheduling in a robotic cell
    • Levner, E., V. Kats, V. E. Levit. 1997. An improved algorithm for cyclic flowshop scheduling in a robotic cell. Eur. J. Oper. Res. 97 500-508.
    • (1997) Eur. J. Oper. Res. , vol.97 , pp. 500-508
    • Levner, E.1    Kats, V.2    Levit, V.E.3
  • 26
    • 0009090861 scopus 로고    scopus 로고
    • The hoist scheduling problem for no-wait production lines - A survey of research
    • Systems Engineering and Engineering Management Department, The Chinese University of Hong Kong, Hong Kong
    • Mak, R., Y. Wong, J. M. Y. Leung, K. Lam, S. M. Gupta. 2000. The hoist scheduling problem for no-wait production lines - A survey of research. Technical report SEEM2000-05, Systems Engineering and Engineering Management Department, The Chinese University of Hong Kong, Hong Kong.
    • (2000) Technical Report , vol.SEEM2000-05
    • Mak, R.1    Wong, Y.2    Leung, J.M.Y.3    Lam, K.4    Gupta, S.M.5
  • 27
    • 0029389031 scopus 로고
    • Determining the optimal number of duplicated process tanks in a single-hoist circuit board production line
    • Ng, W. C. 1995. Determining the optimal number of duplicated process tanks in a single-hoist circuit board production line. Comput. Indust. Engrg. 28(4) 681-688.
    • (1995) Comput. Indust. Engrg. , vol.28 , Issue.4 , pp. 681-688
    • Ng, W.C.1
  • 28
    • 0029770852 scopus 로고    scopus 로고
    • A branch and bound algorithm for hoist scheduling of a circuit board production line
    • Ng, W. C. 1996. A branch and bound algorithm for hoist scheduling of a circuit board production line. Internat. J. Flexible Manufacturing Systems 8 45-65.
    • (1996) Internat. J. Flexible Manufacturing Systems , vol.8 , pp. 45-65
    • Ng, W.C.1
  • 29
    • 0016962332 scopus 로고
    • Mathematical programming solution of a hoist scheduling program
    • Phillips, L. W., P. S. Unger. 1976. Mathematical programming solution of a hoist scheduling program. AIIE Trans. 8(2) 219-225.
    • (1976) AIIE Trans. , vol.8 , Issue.2 , pp. 219-225
    • Phillips, L.W.1    Unger, P.S.2
  • 31
    • 0024029390 scopus 로고
    • Hoist scheduling for a PCB electroplating facility
    • Shapiro, G. W., H. L. W. Nuttle. 1988. Hoist scheduling for a PCB electroplating facility. IIE Trans. 20(2) 157-167.
    • (1988) IIE Trans. , vol.20 , Issue.2 , pp. 157-167
    • Shapiro, G.W.1    Nuttle, H.L.W.2
  • 32
    • 84877343203 scopus 로고
    • An algorithm for scheduling a chemical processing tank line
    • Song, W., Z. Zabinsky, R. Storch. 1993. An algorithm for scheduling a chemical processing tank line. Production Planning Control 4(4) 323-332.
    • (1993) Production Planning Control , vol.4 , Issue.4 , pp. 323-332
    • Song, W.1    Zabinsky, Z.2    Storch, R.3
  • 33
    • 0028317755 scopus 로고
    • A study of heuristics for bi-directional multi-hoist production scheduling system
    • Sun, T. C., K. K. Lai, K. Lam, K. P. So. 1994. A study of heuristics for bi-directional multi-hoist production scheduling system. Internat. J. Production Econom. 33 207-214.
    • (1994) Internat. J. Production Econom. , vol.33 , pp. 207-214
    • Sun, T.C.1    Lai, K.K.2    Lam, K.3    So, K.P.4


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