根据以上描述的码头布局，从作业任务角度看非跨越式双ASC调度作业就是将

根据以上描述的码头布局，从作业任务角度看非跨越式双ASC调度作业就是将作业任务分配给相应的ASC并对分配的任务进行排序。Hu等[3]研究了确定任务分配的非跨越式双ASC调度问题，其中任务分配已知的假设使得调度问题只需确定ASC的作业序列，然而任务分配决策是ASC调度问题的一部分。为了完整地研究非跨越式双ASC调度问题，本文研究考虑任务分配的非跨越式双ASC调度问题，其决策内容包括：1）分配任务集合；2）确定ASC的作业序列。

結果 (英文) 1:

Based on the above description of Terminal layout, double ASC non-leap from the perspective of job tasks scheduling is to assign tasks to the appropriate ASC and sort the assigned tasks. Hu [3] studies to determine assignment scheduling problem for non-leap-forward pair of ASC, which assignment known that allows scheduling only need to determine the sequence of operations of ASC, however ASC is scheduled in task allocation as part of the problem. To completely non-leap-forward pair of ASC scheduling problems, this study considered non-leaping double ASC assignment scheduling problem and its decision-making include: 1) assigned tasks set; 2) to determine the sequence of operations of ASC.

結果 (英文) 2:

According berth layout described above, from the perspective of a non-operational tasks Leaping double ASC job scheduling task is to assign tasks to the job and assigned a corresponding ASC order. Hu et al [3] studied the non-Leaping double ASC scheduling problem determination task allocation, task allocation among the known hypothesis makes scheduling problem Just make sure the job sequence ASC, but the decision is part of the ASC mission assignment scheduling problem. For a complete study of non-Leaping double ASC scheduling problem, this study considered a non-leap-tasking dual ASC scheduling problem, its decision-making include: 1) distribution of tasks set; 2) determine the job sequence of ASC.

結果 (英文) 3:

According to the above description of the layout of the terminal, from the point of view of the task, the task is to assign the task assigned to the corresponding ASC and the assignment of the task to sort the ASC. Hu [3] studied task allocation of non spanning double ASC scheduling problem, which makes the assumption of known task assignment scheduling problem only to determine the working sequence of ASC, however, task allocation is a part of the ASC scheduling problem. In order to complete the study of non leap double ASC scheduling problem, task allocation of non spanning double ASC scheduling problem is considered in this paper, the decision contents include: 1) assign the task set; 2) to determine the operation sequence of ASC.