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.
针对求解最小化最大完工时间和总流程时间的多目标同顺序流水作业问题,提出了一个多目标局部搜索算法。