Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach
Published Online:1 Dec 2004https://doi.org/10.1287/opre.1040.0144
References
- 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–140Crossref, Google Scholar
- Hoist scheduling problem: An approach based on constraints logic programming. Proc. 1992 IEEE Internat. Conf. Robotics Automation (1992) 2. Nice, France:1139–1144Crossref, Google Scholar
- Cyclic scheduling of a hoist with time window constraints. IEEE Trans. Robotics Automation (1998) 14(1):144–152Crossref, Google Scholar
- Robotic flowshop scheduling is strongly NP-complete. Ten Years LNMB(Amsterdam, The Netherlands) 277–286CWI tract 122Google Scholar
- Cyclic scheduling of identical parts in a robotic cell. Oper. Res. (1997b) 45(6):952–965Link, Google Scholar
- Cyclic scheduling in robotic flowshops. Ann. Oper. Res. (2000) 96:97–124Crossref, Google Scholar
- A necessary but insufficient condition for the stochastic binary choice problem. J. Math. Psych. (1990) 34:371–392Crossref, Google Scholar
- Facets of the linear ordering polytope. Math. Programming (1985) 33:43–60Crossref, Google Scholar
- Scheduling in robotic cells: Complexity and steady state analysis. Eur. J. Oper. Res. (1998) 109:43–65Crossref, Google Scholar
- On the scheduling of one-dimensional transport systems. (1997) . Report 97-277, Zentrum für Parelleles Rechnen, University of Cologne, Cologne, GermanyGoogle Scholar
- On a scheduling problem in a robotized analytical system. Discrete Appl. Math. (1996) 65:285–318Crossref, Google Scholar
- An exact optimal cyclic scheduling algorithm for multi-operator service of a production line. Automat. Remote Control (1982) 42(4II):538–543Google Scholar
- 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
- Minimizing the number of robots to meet a given cyclic schedule. Ann. Oper. Res. (1997) 69:209–226Crossref, Google Scholar
- 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–138Crossref, Google Scholar
- Multiple-part cyclic hoist scheduling using a sieve method. IEEE Trans. Robotics Automation (1999) 15(4):704–713Crossref, Google Scholar
- Current trends in deterministic scheduling. Ann. Oper. Res. (1997) 70:1–41Crossref, Google Scholar
- Determining the optimal starting times in a cyclic schedule with a given route. Comput. Oper. Res. (1993) 20(8):807–816Crossref, Google Scholar
- A proof: The cyclic hoist scheduling problem is NP-complete. (1989) . Working paper 89-0016, Rutgers University, New Brunswick, NJGoogle Scholar
- The minimum common-cycle algorithm for cyclic scheduling of two material handling hoists with time windows constraints. Management Sci. (1991) 37:1629–1639Link, Google Scholar
- Determining optimal cyclic hoist schedules in a single-hoist electroplating line. IIE Trans. (1994) 26(2):25–33Crossref, Google Scholar
- Minimizing the fleet size with dependent time-window and single-track constraints. Oper. Res. Lett. (1993) 14:91–98Crossref, Google Scholar
- More facets from fences for linear ordering and acyclic subgraph polytopes. Discrete Appl. Math. (1994) 50:185–200Crossref, Google Scholar
- 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–484Crossref, Google Scholar
- An improved algorithm for cyclic flowshop scheduling in a robotic cell. Eur. J. Oper. Res. (1997) 97:500–508Crossref, Google Scholar
- 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
- Determining the optimal number of duplicated process tanks in a single-hoist circuit board production line. Comput. Indust. Engrg. (1995) 28(4):681–688Crossref, Google Scholar
- A branch and bound algorithm for hoist scheduling of a circuit board production line. Internat. J. Flexible Manufacturing Systems (1996) 8:45–65Crossref, Google Scholar
- Mathematical programming solution of a hoist scheduling program. AIIE Trans. (1976) 8(2):219–225Crossref, Google Scholar
- Sequencing of parts and robot moves in a robotic cell. Internat. J. Flexible Manufacturing Systems (1992) 4:331–358Crossref, Google Scholar
- Hoist scheduling for a PCB electroplating facility. IIE Trans. (1988) 20(2):157–167Crossref, Google Scholar
- An algorithm for scheduling a chemical processing tank line. Production Planning Control (1993) 4(4):323–332Crossref, Google Scholar
- A study of heuristics for bi-directional multi-hoist production scheduling system. Internat. J. Production Econom. (1994) 33:207–214Crossref, Google Scholar
- A hoist scheduling application in chemical production line. Intelligent Scheduling of Robots and Flexible Manufacturing Systems (1996) (CTEH Press, Holon, Israel) 267–281Google Scholar

