0305-0548

Computers & Operations Research （COR） - Volume 36, Issue 4 论文列表

点击这里查看 Computers & Operations Research 的JCR分区、影响因子等信息
卷期号： Volume 36, Issue 4
发布时间： April 2009
卷期年份： 2009
卷期官网： https://www.sciencedirect.com/journal/computers-and-operations-research/vol/36/issue/4
本期论文列表
Title Page/Editorial Board

An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables

Risk management in uncapacitated facility location models with random demands

A systematic procedure to obtain a preferable and robust ranking of units

Heuristic approaches for the two- and three-dimensional knapsack packing problem

Two-commodity reliability evaluation of a stochastic-flow network with varying capacity weight in terms of minimal paths

LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity

Exact algorithms for the matrix bid auction

Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times

A hybrid method based on linear programming and tabu search for routing of logging trucks

The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach

A two-machine flowshop problem with processing time-dependent buffer constraints—An application in multimedia presentations

An exterior simplex type algorithm for the Minimum Cost Network Flow Problem

Decremental state space relaxation strategies and initialization heuristics for solving the Orienteering Problem with Time Windows with dynamic programming

Preprocessing DEA

Towards optimal use of incomplete classification data

Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines

Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm

Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness

An integer programming approach to generating airline crew pairings

A comparison of solution strategies for biobjective shortest path problems