%0 Journal Article
%T Bi
%A Binghai Zhou
%A Zhongshun Gao
%J Proceedings of the Institution of Mechanical Engineers, Part I: Journal of Systems and Control Engineering
%@ 2041-3041
%D 2019
%R 10.1177/0959651818789754
%X To solve the scheduling problem of a single hoist with processing-time-window constraints considering buffer-setting, we consider bi-objective scheduling which makes trade-offs between the cycle time and the hoist travel distance. First, a bi-objective mixed-integer programming model is constructed for the basic line without considering buffer-setting. In order to improve the throughput of the basic line, a transform method with buffer-setting is put forward. Based on the basic line model, a subsection searching ŠĆ-constraint method which combines the transform method is introduced to solve the bi-objective mixed-integer programming model. Experimental results both on benchmark instances and on randomly generated instances indicate that the proposed approach is efficient and buffers can improve the throughputs
%K Bi-objective
%K buffer-setting
%K ŠĆ-constraint method
%K hoist-scheduling problem
%K mixed-integer programming
%U https://journals.sagepub.com/doi/full/10.1177/0959651818789754