0305-0548

Computers & Operations Research (COR) - Volume 39, Issue 3 论文列表

本期论文列表
Title Page/Editorial Board

Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates

Heuristic approaches for master planning in semiconductor manufacturing

Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time

Greedy algorithms for a class of knapsack problems with binary weights

An improved algorithm for the longest common subsequence problem

Inequality constraint handling in genetic algorithms using a boundary simulation method

Risk-averse two-stage stochastic programming with an application to disaster management

Performance evaluation of a synchronization station with multiple inputs and population constraints

Batch scheduling on uniform machines to minimize total flow-time

Simulated annealing for optimal ship routing

Makespan minimization on single batch-processing machine via ant colony optimization

Cliques with maximum/minimum edge neighborhood and neighborhood density

Capacitated clustering problem in computational biology: Combinatorial and statistical approach for sibling reconstruction

Lagrangean relaxation heuristics for the p-cable-trench problem

A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints

An LP-based heuristic algorithm for the node capacitated in-tree packing problem

Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems

Single-machine makespan minimization scheduling with nonlinear shortening processing times

Shift-and-merge technique for the DP solution of the time-constrained backpacker problem

The dynamic space allocation problem: Applying hybrid GRASP and Tabu search metaheuristics

Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem

A modified artificial bee colony algorithm

Interior point methods in DEA to determine non-zero multiplier weights

A heuristic algorithm based on Lagrangian relaxation for the closest string problem

A Lagrangian approach for minimum cost single round robin tournaments

An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem

Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage

Improved LP-based algorithms for the closest string problem