"problem formulation" trang 15 - tải miễn phí từ tailieuXANH
Mathematical models for a batch scheduling problem to minimize earliness and tardiness

Mathematical models for a batch scheduling problem to minimize earliness and tardiness
16    59    0
Artificial Bee colony for resource constrained project scheduling problem

Artificial Bee colony for resource constrained project scheduling problem
16    59    0
New methods for solving a vertex p-center problem with uncertain demand-weighted distance: A real case study

New methods for solving a vertex p-center problem with uncertain demand-weighted distance: A real case study
14    80    0
Integrated approach in solving parallel machine scheduling and location (ScheLoc) problem

Integrated approach in solving parallel machine scheduling and location (ScheLoc) problem
12    45    0
A mathematical model for the product mixing and lot-sizing problem by considering stochastic demand

A mathematical model for the product mixing and lot-sizing problem by considering stochastic demand
14    67    0
A hybrid metaheuristic for the time-dependent vehicle routing problem with hard time windows

A hybrid metaheuristic for the time-dependent vehicle routing problem with hard time windows
20    75    0
Solving a bi-objective mathematical programming model for bloodmobiles location routing problem

Solving a bi-objective mathematical programming model for bloodmobiles location routing problem
14    57    0
Single machine batch processing problem with release dates to minimize total completion time

Single machine batch processing problem with release dates to minimize total completion time
18    50    0
A simulated annealing algorithm for unequal area dynamic facility layout problems with flexible bay structure

A simulated annealing algorithm for unequal area dynamic facility layout problems with flexible bay structure
24    52    0
Dynamic capacitated maximal covering location problem by considering dynamic capacity

Dynamic capacitated maximal covering location problem by considering dynamic capacity
16    54    0
Solving a multi-objective location routing problem for infectious waste disposal using hybrid goal programming and hybrid genetic algorithm

Solving a multi-objective location routing problem for infectious waste disposal using hybrid goal programming and hybrid genetic algorithm
24    54    0
Consolidation centers in city logistics: A cooperative approach based on the location routing problem

Consolidation centers in city logistics: A cooperative approach based on the location routing problem
12    86    0
Firefly algorithm based upon slicing structure encoding for unequal facility layout problem

Firefly algorithm based upon slicing structure encoding for unequal facility layout problem
12    163    0
A hybrid genetic-gravitational search algorithm for a multi-objective flow shop scheduling problem

A hybrid genetic-gravitational search algorithm for a multi-objective flow shop scheduling problem
18    59    0
Solving a multi-objective manufacturing cell scheduling problem with the consideration of warehouses using a simulated annealing based procedure

Solving a multi-objective manufacturing cell scheduling problem with the consideration of warehouses using a simulated annealing based procedure
16    55    0
Multiobjective optimization in delivering pharmaceutical products with disrupted vehicle routing problem

Multiobjective optimization in delivering pharmaceutical products with disrupted vehicle routing problem
18    55    0
A discrete Jaya algorithm for permutation flow-shop scheduling problem

A discrete Jaya algorithm for permutation flow-shop scheduling problem
14    60    0
A modified tabu search algorithm for the single-machine scheduling problem using additive manufacturing technology

A modified tabu search algorithm for the single-machine scheduling problem using additive manufacturing technology
14    124    1
Study on clogging problem of drip irrigation systems and its remedies

Study on clogging problem of drip irrigation systems and its remedies
8    65    0
A two-stage method for assessing the efficiency of the three-stage series network data envelopment analysis model with two feedback

A two-stage method for assessing the efficiency of the three-stage series network data envelopment analysis model with two feedback
14    78    0
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.