Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach

Published Online:https://doi.org/10.1287/opre.1040.0144

References

  • Armstrong R., Lei L., Gu S. A bounding scheme for deriving the minimal cycle time of a single-transporter N-stage process with time-window constraints. Eur. J. Oper. Res. (1994) 78:130–140CrossrefGoogle Scholar
  • Baptiste P., Legeard B., Varnier C. Hoist scheduling problem: An approach based on constraints logic programming. Proc. 1992 IEEE Internat. Conf. Robotics Automation (1992) 2. Nice, France:1139–1144CrossrefGoogle Scholar
  • Chen H., Chu C., Proth J.-M. Cyclic scheduling of a hoist with time window constraints. IEEE Trans. Robotics Automation (1998) 14(1):144–152CrossrefGoogle Scholar
  • Crama Y., van de Klundert J. Robotic flowshop scheduling is strongly NP-complete. Ten Years LNMB(Amsterdam, The Netherlands) 277–286CWI tract 122Google Scholar
  • Crama Y., van de Klundert J. Cyclic scheduling of identical parts in a robotic cell. Oper. Res. (1997b) 45(6):952–965LinkGoogle Scholar
  • Crama Y., Kats V., van de Klundert J., Levner E. Cyclic scheduling in robotic flowshops. Ann. Oper. Res. (2000) 96:97–124CrossrefGoogle Scholar
  • Gilboa I. A necessary but insufficient condition for the stochastic binary choice problem. J. Math. Psych. (1990) 34:371–392CrossrefGoogle Scholar
  • Grötschel M., Jünger M., Reinelt G. Facets of the linear ordering polytope. Math. Programming (1985) 33:43–60CrossrefGoogle Scholar
  • Hall N. G., Kamoun H., Sriskandarajah C. Scheduling in robotic cells: Complexity and steady state analysis. Eur. J. Oper. Res. (1998) 109:43–65CrossrefGoogle Scholar
  • Heinrichs U., Moll C. On the scheduling of one-dimensional transport systems. (1997) . Report 97-277, Zentrum für Parelleles Rechnen, University of Cologne, Cologne, GermanyGoogle Scholar
  • Hertz A., Mottet Y., Rochat Y. On a scheduling problem in a robotized analytical system. Discrete Appl. Math. (1996) 65:285–318CrossrefGoogle Scholar
  • Kats V. An exact optimal cyclic scheduling algorithm for multi-operator service of a production line. Automat. Remote Control (1982) 42(4II):538–543Google Scholar
  • Kats V., Levner E. Polynomial algorithms for scheduling of robots. Intelligent Scheduling of Robots and Flexible Manufacturing Systems (1996) (CTEH Press, Center for Technological Education, Holon, Israel) 77–100Google Scholar
  • Kats V., Levner E. Minimizing the number of robots to meet a given cyclic schedule. Ann. Oper. Res. (1997) 69:209–226CrossrefGoogle Scholar
  • Kats V., Levner E. 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 (1998) 10:129–138CrossrefGoogle Scholar
  • Kats V., Levner E., Meyzin L. Multiple-part cyclic hoist scheduling using a sieve method. IEEE Trans. Robotics Automation (1999) 15(4):704–713CrossrefGoogle Scholar
  • Lee C.-Y., Lei L., Pinedo M. Current trends in deterministic scheduling. Ann. Oper. Res. (1997) 70:1–41CrossrefGoogle Scholar
  • Lei L. Determining the optimal starting times in a cyclic schedule with a given route. Comput. Oper. Res. (1993) 20(8):807–816CrossrefGoogle Scholar
  • Lei L., Wang T. J. A proof: The cyclic hoist scheduling problem is NP-complete. (1989) . Working paper 89-0016, Rutgers University, New Brunswick, NJGoogle Scholar
  • Lei L., Wang T. J. The minimum common-cycle algorithm for cyclic scheduling of two material handling hoists with time windows constraints. Management Sci. (1991) 37:1629–1639LinkGoogle Scholar
  • Lei L., Wang T. J. Determining optimal cyclic hoist schedules in a single-hoist electroplating line. IIE Trans. (1994) 26(2):25–33CrossrefGoogle Scholar
  • Lei L., Armstrong R., Gu S. Minimizing the fleet size with dependent time-window and single-track constraints. Oper. Res. Lett. (1993) 14:91–98CrossrefGoogle Scholar
  • Leung J., Lee J. More facets from fences for linear ordering and acyclic subgraph polytopes. Discrete Appl. Math. (1994) 50:185–200CrossrefGoogle Scholar
  • Leung J., Zhang G. Optimal simple cyclic scheduling for printed circuit board production lines with multiple hoists and general processing sequence. IEEE Trans. Robotics Automation (2003) 19(3):480–484CrossrefGoogle Scholar
  • Levner E., Kats V., Levit V. E. An improved algorithm for cyclic flowshop scheduling in a robotic cell. Eur. J. Oper. Res. (1997) 97:500–508CrossrefGoogle Scholar
  • Mak R., Wong Y., Leung J. M. Y., Lam K., Gupta S. M. The hoist scheduling problem for no-wait production lines—A survey of research. (2000) . Technical report SEEM2000-05, Systems Engineering and Engineering Management Department, The Chinese University of Hong Kong, Hong KongGoogle Scholar
  • Ng W. C. Determining the optimal number of duplicated process tanks in a single-hoist circuit board production line. Comput. Indust. Engrg. (1995) 28(4):681–688CrossrefGoogle Scholar
  • Ng W. C. A branch and bound algorithm for hoist scheduling of a circuit board production line. Internat. J. Flexible Manufacturing Systems (1996) 8:45–65CrossrefGoogle Scholar
  • Phillips L. W., Unger P. S. Mathematical programming solution of a hoist scheduling program. AIIE Trans. (1976) 8(2):219–225CrossrefGoogle Scholar
  • Sethi S., Sriskandarajah C., Sorger G., Blazewicz J., Kubiak W. Sequencing of parts and robot moves in a robotic cell. Internat. J. Flexible Manufacturing Systems (1992) 4:331–358CrossrefGoogle Scholar
  • Shapiro G. W., Nuttle H. L. W. Hoist scheduling for a PCB electroplating facility. IIE Trans. (1988) 20(2):157–167CrossrefGoogle Scholar
  • Song W., Zabinsky Z., Storch R. An algorithm for scheduling a chemical processing tank line. Production Planning Control (1993) 4(4):323–332CrossrefGoogle Scholar
  • Sun T. C., Lai K. K., Lam K., So K. P. A study of heuristics for bi-directional multi-hoist production scheduling system. Internat. J. Production Econom. (1994) 33:207–214CrossrefGoogle Scholar
  • Varnier C., Bachelu A., Baptiste P. A hoist scheduling application in chemical production line. Intelligent Scheduling of Robots and Flexible Manufacturing Systems (1996) (CTEH Press, Holon, Israel) 267–281Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.