Abstract
In automated plating processes, hoists ensure the transfer of products between workstations. Scheduling their movements is known as the Hoist Scheduling Problem (HSP). It belongs to the class of strongly NP-hard problems (Lei and Wang, 1989b). Many studies, dealing with different complexity levels of the problem have been published, and the following classification should give the reader quite a large overview of them.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
