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

卷期号： Volume 35, Issue 4

发布时间： April 2008

卷期年份： 2008

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

Title Page/Editorial Board

Estimating steady-state distributions via simulation-generated histograms

Scale-invariant clustering with minimum volume ellipsoids

Ant colony optimization combined with taboo search for the job shop scheduling problem

Benders decomposition for the uncapacitated multiple allocation hub location problem

Reactive GRASP for the strip-packing problem

A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes

A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times

A deterministic tabu search algorithm for the capacitated arc routing problem

Search tree based approaches for parallel machine scheduling

A double scaling algorithm for the constrained maximum flow problem

Modeling realistic hybrid flexible flowshop scheduling problems

A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates

A computational study of DEA with massive data sets

A column generation and branch-and-cut algorithm for the channel assignment problem

Minimizing the number of late jobs for the permutation flowshop problem with secondary resources

Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times

Applying evolutionary computation to the school timetabling problem: The Greek case

A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem

Heuristics for automated knowledge source integration and service composition

A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem

A differential evolution approach for the common due date early/tardy job scheduling problem

Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan

Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics

A note on “the capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times