两台不同速码头起重机调度问题的改进分析

Better Analysis of Scheduling Two Uniform Quay Cranes with Non-interference Constraints

主要研究了无交叉作业的两台不同速码头起重机调度问题.为了缩短装(卸)载总耗时,改进了已有相关算法的分析过程,得到了算法的最坏情况紧界为{min(s+1)/s,(s+1)2/(2s+1}).

This paper studies a problem of scheduling two uniform quay cranes with non-interference constraints.To minimize the overall time of loading or unloading the container,we provide a better analysis of aprevious algorithm,obtaining its tig{ht worst-case ratio min(s+1)/s,(s+1)2/(2s+1}).