makespan

基本解释

The ACA for the ASP is proved to be better than FCFS, which can decrease the makespan of landing airplanes by 14%.
結果表明，ASP蟻群算法優於FCFS調度方法，可以使著陸隊列完成時間減少約14%25。
An ant-colony heuristic algorithm was proposed for the No-Wait Flow Shop problem(NWFS) with makespan criterion.
針對以最大完成時間爲目標的無等待流水車間調度問題,提出了一種蟻群算法。
Discrete Particle Swarm Optimization (DPSO) algorithm was proposed for no-wait flow shop scheduling problem with makespan criterion.
摘要針對以生産周期爲目標的無等待流水車間調度問題，提出了一種離散粒子群優化算法。
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).
摘要考慮竝行批加工機上不同尺寸工件的調度問題；目標是極小化最大完工時間。
Multi-Objective Local Search(MOLS) algorithm was proposed to solve the permutation flowshop sequencing problem with bi-objectives of makespan and total flowtime.
針對求解最小化最大完工時間和縂流程時間的多目標同順序流水作業問題,提出了一個多目標侷部搜索算法。