نتایج جستجو برای: Tabu Search Algorithm
تعداد نتایج: 980849 فیلتر نتایج به سال:
This paper deals with the assembly line balancing issue. The considered objective is to minimize weighted sum of products’ cycle times. originality this that it generalization time minimization used in single-model lines (SALBP) multi-model case (MALBP). An optimization algorithm made a heuristic and tabu-search method presented evaluated through an experimental study carried out on several var...
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید