1. Lei L, Wang TJ. A proof: the cyclic hoist scheduling problem is NP-complete. Working Paper #89-0016, Graduate School of Management, Rutgers University, NJ, 1989.
2. Hoist scheduling problem: an approach based on constraints logic programming;Baptiste;Proceedings of IEEE Conference on Robotics and Automation,1992
3. Optimization of programmable hoists using linear programming;Bracker;Printed Circuit Fabrication,1985
4. Cyclic scheduling of a hoist with time window constraints;Chen;IEEE Transactions on Robotics and Automation,1998
5. Determining optimal cyclic hoist schedules in a single-hoist electroplating line;Lei;IIE Transactions,1994