0305-0548

Computers & Operations Research （COR） - Volume 39, Issue 9 论文列表

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

Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs

Scheduling job classes on uniform machines

A wide-ranging computational comparison of high-performance graph colouring algorithms

GISMOO: A new hybrid genetic/immune strategy for multiple-objective optimization

Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: An algorithm with reoptimization

A stochastic production planning problem with nonlinear cost

An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem

Inventory models for imperfect production and inspection processes with various inspection options under one-time and continuous improvement investment

A genetic algorithm for solving the fixed-charge transportation model: Two-stage problem

A parallel iterated tabu search heuristic for vehicle routing problems

Modifying lines-of-flight in the planning process for improved maintenance robustness

Modeling and solving rich quay crane scheduling problems

Efficient metaheuristics to solve the intermodal terminal location problem

Energy efficient spatial TDMA scheduling in wireless networks

Analytical study on multi-product production planning with outsourcing

Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method

The min-conflict packing problem

Variable neighborhood descent with iterated local search for routing and wavelength assignment

A study on the effect of the asymmetry on real capacitated vehicle routing problems

A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion

The Traveling Salesman Problem with Draft Limits

Simplified swarm optimization in disassembly sequencing problems with learning effects

A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP

Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance

Gaussian variable neighborhood search for continuous optimization

A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem

Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem

A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty

A branch-and-price algorithm for the general case of scheduling parallel machines with a single server

A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints

On single-walk parallelization of the job shop problem solving algorithms

Corrigendum to “Enumerating all spanning trees for pairwise comparisons” [Comput. Oper. Res. 39 (2012) 191–199]

An algorithmic framework for solving large scale multistage stochastic mixed 0–1 problems with nonsymmetric scenario trees