1. Armstrong, R., Lei, L. & Gu, S. (1994). A bounding scheme for deriving the minimal cycle time of a single-transporter N-stage process with time-window constraints. European Journal of Operational Research, 75: 1–11.
2. Baptiste, P., Legeard B. & Varnier C. (1992). Hoist scheduling problem: an approach based on Constraint Logic Programming. IEEE International Conference on Robotics and Automation, Nice.
3. Collart Dutilleul, S. & Denat, J-P.(1998). P-time Petri nets and the Hoist Scheduling Problem. International Conference on Systems, Man, and Cybernetics. DOI 10.1109/ICSMC.1998.725471.
4. Drath, R. (1997). Available on onlie, http://www.r-drath.de/Home/Visual_Object_Net++.html. Cited November 2015.
5. El-Amraoui (2015). Combinatorial optimization approaches for multi-part cyclic hoist scheduling problem. 4OR, 13(1): 111–112.