TY - GEN
T1 - A mixed integer linear programming approach for multi-degree cyclic multi-hoist scheduling problems without overlapping
AU - Li, Xin
AU - Fung, Richard Y.K.
PY - 2013
Y1 - 2013
N2 - This paper considers multi-degree cyclic multi-hoist scheduling problems without overlapping. Identical parts are produced in tanks for stages with processing time window constraints. The objective of this research is to obtain a schedule that can maximize the throughput of the line at steady state, equivalently minimize the cycle time. There are three kinds of constraints in cyclic hoist scheduling problems, i.e. hoist available constraints, tank capacity constraints and time window constraints. Moreover, schedules must void hoist conflicts in multi-hoist scenarios, since multiple hoists use the same overhead track and they cannot cross over each other. In this paper, the hoist assignment strategy without overlapping is used to void hoist conflicts. In order to obtain the optimal schedule, a mixed integer linear programming model is formulated. Then, a numerical example is used to illustrate the model proposed. © 2013 IEEE.
AB - This paper considers multi-degree cyclic multi-hoist scheduling problems without overlapping. Identical parts are produced in tanks for stages with processing time window constraints. The objective of this research is to obtain a schedule that can maximize the throughput of the line at steady state, equivalently minimize the cycle time. There are three kinds of constraints in cyclic hoist scheduling problems, i.e. hoist available constraints, tank capacity constraints and time window constraints. Moreover, schedules must void hoist conflicts in multi-hoist scenarios, since multiple hoists use the same overhead track and they cannot cross over each other. In this paper, the hoist assignment strategy without overlapping is used to void hoist conflicts. In order to obtain the optimal schedule, a mixed integer linear programming model is formulated. Then, a numerical example is used to illustrate the model proposed. © 2013 IEEE.
UR - https://www.scopus.com/pages/publications/84891514953
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84891514953&origin=recordpage
U2 - 10.1109/CoASE.2013.6653893
DO - 10.1109/CoASE.2013.6653893
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 9781479915156
SP - 274
EP - 279
BT - IEEE International Conference on Automation Science and Engineering
T2 - 2013 IEEE International Conference on Automation Science and Engineering, CASE 2013
Y2 - 17 August 2013 through 20 August 2013
ER -