makespans

基本解釋

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