研究了以最大完工时间为目标的零空闲流水线调度问题。
No-idle flow shop(NIFS) problem with makespan criterion is studied.
考虑并行批加工机上不同尺寸工件的调度问题；目标是极小化最大完工时间。
The problem of scheduling jobs with non-identical sizes on parallel batching machines is considered; the objective is to minimize the maximum completion time (makespan).
因此问题就需要决定是否中断，以及何时中断，使得最大完工时间、完工时间总和、加权完工时间总和等尽可能小。
Thus the problem is to make a decision on whether and when to start the breakdown so as to minimize the maximum completion time, the total completion time or the weighted total completion time.
讨论任务的加工是不可中断，机器速度相同且机器具有不同开始加工时间的排序问题，目标函数是极小化最大完工时间。
We discuss the nonpreemptive parallel machine scheduling problem with nonsimultaneous available time, the objective function is to minimize the makespan.
我们所考虑的目标函数由所有工件的加权完工时间之和与对所有工件的实际加工时间偏离额定加工时间的最大不满意程度这两部分组成。
The objective function being considered was the sum of weighted completion times of all jobs plus the maximum dissatisfaction of all jobs processing times that deviated from their specified ones.
在允许机器空闲的条件下，寻找一个工件排序，使得最大提前完工时间最小。
Under the condition of permission the idle insert, a job sequence was determined, which minimize the maximum earliness.
讨论这样一类单机排序问题：每个工件联系一个交货期窗口；如果工件的完工时间落在该工件的交货期窗口内，则称该工件的完工是满意的；排序的优化准则是完工为满意的工件个数最大。
In this paper, we consider such a scheduling model: a due date window is associated with each job, a job is call satisfying job if its completion time lies in its corresponding due date window.
讨论这样一类单机排序问题：每个工件联系一个交货期窗口；如果工件的完工时间落在该工件的交货期窗口内，则称该工件的完工是满意的；排序的优化准则是完工为满意的工件个数最大。
In this paper, we consider such a scheduling model: a due date window is associated with each job, a job is call satisfying job if its completion time lies in its corresponding due date window.
应用推荐