FDA Building / Australasian Institute of Mining / COSMO Stochastic Mine Planning Laboratory / McGill University / University Street / /
IndustryTerm
residual mining capacity / neighbourhood descent algorithm / metal content / online version / good solutions / fundamental tree algorithm / residual processing capacity / branch-and-cut algorithm / open pit mining production scheduling problem / Variable neighborhood search / integer solution / block mining sequence / good feasible solutions / particle swarm algorithm / open-pit mining operations / waste mining / metal / open-pit mining / variable neighbourhood descent algorithm / polynomial maximum-flow algorithms / diversified tabu search approach / efficient algorithm / feasible solution / capacitated open pit mining problem / model metal uncertainty / open pit mining problem / branchand-cut algorithm / genetic algorithms / feasible neighbour solution / metal uncertainty / worst solution / mining / block processing selectivity / /
OperatingSystem
Linux / /
Organization
Australasian Institute of Mining and Metallurgy / Natural Science and Engineering Research Council of Canada CRDPJ / McGill University / Institution of Mining and Metallurgy / Operational Research Society / Society for Mining / Metallurgy & Exploration / FDA / Oxford University / /
Person
Amina Lamghari / T. Amina Lamghari / Bt / Min Gap / Tabu / Max Gap / /
Position
Rt / b2Bt wb / bs wb / /
ProvinceOrState
Western Australia / Quebec / British Columbia / /
PublishedMedium
Lecture Notes in Computer Science / /
RadioStation
Gleixner AM / Newman AM / /
Region
Western Australia / /
Technology
RAM / branchand-cut algorithm / fundamental tree algorithm / t-1 / particle swarm algorithm / Linux / scheduling algorithm / efficient algorithm / variable neighbourhood descent algorithm / branch-and-cut algorithm / simulation / known polynomial maximum-flow algorithms / /
A variable neighbourhood descent algorithm for the open-pit mine production scheduling problem with metal uncertainty