Computers & Operations Research（COR ）的VOLUME 35, ISSUE 3论文列表

卷期号： Volume 35, Issue 3

发布时间： March 2008

卷期年份： 2008

卷期官网： https://www.sciencedirect.com/journal/computers-and-operations-research/vol/35/issue/3

Title Page/Editorial Board

New trends in locational analysis

A generalized model of equality measures in network location problems

Multi-period capacitated location with modular equipments

Discrete models for competitive location with foresight

Locating a low-level waste disposal site

Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem

The 1-center problem in the plane with independent random weights

Quasiconvex constrained multicriteria continuous location problems: Structure of nondominated solution sets

Categorical data fuzzy clustering: An analysis of local search heuristics

A case-based distance model for multiple criteria ABC analysis

Adaptive memory programing for the robust capacitated international sourcing problem

A new modeling and solution approach for the set-partitioning problem

A multiperiod set covering location model for dynamic redeployment of ambulances

Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times

A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines

Solving the swath segment selection problem through Lagrangean relaxation

A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property

A two-machine flowshop scheduling problem with a separated maintenance constraint

A loss function approach to group preference aggregation in the AHP

On the performance of binomial and beta-binomial models of demand forecasting for multiple slow-moving inventory items

Lagrangian bounds for just-in-time job-shop scheduling

Lot sizing and furnace scheduling in small foundries

A Lagrangean relaxation approach for the mixed-model flow line sequencing problem

A new constraint programming approach for the orthogonal packing problem

A graph coloring heuristic using partial solutions and a reactive tabu scheme

A comparison of multiprocessor task scheduling algorithms with communication costs

A note on cycling LP examples with permutation structure