Computers & Operations Research（COR ）的VOLUME 133论文列表

卷期号： Volume 133

发布时间： September 2021

卷期年份： 2021

卷期官网： https://www.sciencedirect.com/journal/computers-and-operations-research/vol/133/suppl/C

Editorial Board

New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems

Using 3D-printing in disaster response: The two-stage stochastic 3D-printing knapsack problem

A data-driven flight schedule optimization model considering the uncertainty of operational displacement

Vehicle routing with private and shared delivery locations

Location and two-echelon inventory network design with economies and diseconomies of scale in facility operating costs

Scheduling with competing agents, total late work and job rejection

Symmetric projection group approach for promoting homogeneity in the analytic hierarchy process

Integer programming approaches to the multiple team formation problem

Optimizing price, order quantity, and backordering level using a nonlinear holding cost and a power demand pattern

An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems

A swarm intelligence graph-based pathfinding algorithm (SIGPA) for multi-objective route planning

Automatic generation of algorithms for robust optimisation problems using Grammar-Guided Genetic Programming

A revised formulation, library and heuristic for a chemical tanker scheduling problem

Semi-robust layout design for cellular manufacturing in a dynamic environment

Multi- and many-objective path-relinking: A taxonomy and decomposition approach

A strategic oscillation simheuristic for the Time Capacitated Arc Routing Problem with stochastic demands

Single batch machine scheduling with dual setup times for autoclave molding manufacturing

A reinforcement learning approach to the orienteering problem with time windows

Solving the generalized multi-port container stowage planning problem by a matheuristic algorithm

The index selection problem with configurations and memory limitation: A scatter search approach

The joint network vehicle routing game with optional customers

Heuristics for k-domination models of facility location problems in street networks