batch job scheduling

基本解釋

The objective of this paper is to minimize the delivery time and the batch scheduling problems with job processing times are the same.
本文主要研究極小化工件配送時間及工件加工時間相同時的分批配送問題。
Again, when scheduling non-sequential batch jobs, they can all be scheduled at 23:00 because they will be queued one at a time though the job spooler.
同樣，在調(diào)度不連續(xù)的批作業(yè)時，可以把它們都安排在 23:00，因為它們會通過假脫機(jī)程序每次運(yùn)行一個。
In batch scheduling problems, B jobs can be processed on the machine at most, and they are not allowed to be interrupted, removed, or added a new job during processing.
在分批排序問題中，機(jī)器一次最多可加工B個工件，工件在加工過程中不允許被打斷、移出或加入新工件；