0305-0548

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

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

MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server

Oil production optimization solved by piecewise linearization in a Branch & Price framework

Data envelopment analysis based on maximin relative efficiency criterion

Sequencing counts: A combined approach for sequencing and selecting costly unreliable off-line inspections

Selection of a representative set of parameters for robust ordinal regression outranking methods

Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems

Robust hedging strategies

The inventory-routing problem with transshipment

Algorithms for on-line order batching in an order picking warehouse

A robust two-phase heuristic algorithm for the truck scheduling problem in a resource-constrained crossdock

A model predictive control approach for discrete-time rescheduling in complex central railway station areas

An integer programming-based local search for the covering salesman problem

A Tabu search algorithm for the network pricing problem

A hierarchical solution approach for a multicommodity distribution problem under a special cost structure

A computational study of a nonlinear minsum facility location problem

A faster polynomial algorithm for the constrained maximum flow problem

Solving a group layout design model of a dynamic cellular manufacturing system with alternative process routings, lot splitting and flexible reconfiguration by simulated annealing

An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times

Computing solutions of the paintshop–necklace problem

Hybrid Adaptive Large Neighborhood Search for the Optimal Statistic Median Problem

Penalty guided bees search for redundancy allocation problems with a mix of components in series–parallel systems

Mind the gap: A study of Tube tour

Heuristic approaches for the optimal wiring in large scale robotic skin design

Star p-hub center problem and star p-hub median problem with bounded path lengths

Tail distribution of the delay in a general batch-service queueing model

A computational study of the capacity scaling algorithm for the maximum flow problem

Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression

Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem

MIP formulations and heuristics for two-level production-transportation problems

Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans

Topological arrangements of M/G/c/K, M/G/c/c queues in transportation and material handling systems

Rule-based scheduling in wafer fabrication with due date-based objectives

A wise cost-effective supplying bandwidth policy for multilayer wireless cognitive networks

Efficient algorithms for real-life instances of the variable size bin packing problem

New linearizations of quadratic assignment problems

LTL logistics networks with differentiated services

A three-phase algorithm for flowshop scheduling with blocking to minimize makespan

Efficient determination of the k most vital edges for the minimum spanning tree problem

Corrigendum to “Simultaneous location of a service facility and a rapid transit line” [Computers & Operations Research 38(2) (2011) 525–538]