Journal: Computers and Operations Research

Found 2748 papers in total
A stochastic production planning problem with nonlinear cost
A stochastic production planning problem with nonlinear cost
2012,
Most production planning models are deterministic and often assume a linear relation...
An incomplete m‐exchange algorithm for solving the large‐scale multi‐scenario knapsack problem
An incomplete m‐exchange algorithm for solving the large‐scale multi‐scenario knapsack problem
2012,
This paper introduces a fast heuristic based algorithm for the max–min...
Inventory models for imperfect production and inspection processes with various inspection options under one‐time and continuous improvement investment
Inventory models for imperfect production and inspection processes with various inspection options under one‐time and continuous improvement investment
2012,
This study investigates both internal and external effects of defective production and...
A genetic algorithm for solving the fixed‐charge transportation model: Two‐stage problem
A genetic algorithm for solving the fixed‐charge transportation model: Two‐stage problem
2012,
Transportation of goods in a supply chain from plants to customers through...
A parallel iterated tabu search heuristic for vehicle routing problems
A parallel iterated tabu search heuristic for vehicle routing problems
2012,
This paper introduces a parallel iterated tabu search heuristic for solving four...
Modifying lines‐of‐flight in the planning process for improved maintenance robustness
Modifying lines‐of‐flight in the planning process for improved maintenance robustness
2012,
As a part of their planning process, airlines construct lines‐of‐flight...
Modeling and solving rich quay crane scheduling problems
Modeling and solving rich quay crane scheduling problems
2012,
The quay crane scheduling problem is a core task of managing maritime container...
Efficient metaheuristics to solve the intermodal terminal location problem
Efficient metaheuristics to solve the intermodal terminal location problem
2012,
The objective of the intermodal terminal location problem is to determine which of a...
Energy efficient spatial TDMA scheduling in wireless networks
Energy efficient spatial TDMA scheduling in wireless networks
2012,
It is now widely acknowledged that packet scheduling can have a significant impact in...
Analytical study on multi‐product production planning with outsourcing
Analytical study on multi‐product production planning with outsourcing
2012,
This paper studies a problem on multi‐product capacitated production planning...
Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method
Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method
2012,
An adaptive memory projection (referred as AMP) method is developed for...
The min‐conflict packing problem
The min‐conflict packing problem
2012,
In the classical bin‐packing problem with conflicts (BPC), the goal is to...
Variable neighborhood descent with iterated local search for routing and wavelength assignment
Variable neighborhood descent with iterated local search for routing and wavelength assignment
2012,
In this work we treat the Routing and Wavelength Assignment (RWA) with focus on...
A study on the effect of the asymmetry on real capacitated vehicle routing problems
A study on the effect of the asymmetry on real capacitated vehicle routing problems
2012,
Matrices with distances between pairs of locations are essential for solving vehicle...
A hybrid discrete differential evolution algorithm for the no‐idle permutation flow shop scheduling problem with makespan criterion
A hybrid discrete differential evolution algorithm for the no‐idle permutation flow shop scheduling problem with makespan criterion
2012,
This paper presents a hybrid discrete differential evolution (HDDE) algorithm for the...
The Traveling Salesman Problem with Draft Limits
The Traveling Salesman Problem with Draft Limits
2012,
In maritime transportation, routing decisions are sometimes affected by draft limits...
Simplified swarm optimization in disassembly sequencing problems with learning effects
Simplified swarm optimization in disassembly sequencing problems with learning effects
2012,
In classical disassembly sequencing problems (DSPs), the disassembly time of each item...
A two‐stage tabu search algorithm with enhanced packing heuristics for the 3L‐CVRP and M3L‐CVRP
A two‐stage tabu search algorithm with enhanced packing heuristics for the 3L‐CVRP and M3L‐CVRP
2012,
The Three‐Dimensional Loading Capacitated Vehicle Routing Problem...
Minimizing the number of tardy jobs in a single‐machine scheduling problem with periodic maintenance
Minimizing the number of tardy jobs in a single‐machine scheduling problem with periodic maintenance
2012,
This research focuses on the problem of scheduling jobs on a single machine that...
Gaussian variable neighborhood search for continuous optimization
Gaussian variable neighborhood search for continuous optimization
2012,
Variable Neighborhood Search (VNS) has shown to be a powerful tool for solving both...
A comparative study of two hybrid grouping evolutionary techniques for the capacitated P‐median problem
A comparative study of two hybrid grouping evolutionary techniques for the capacitated P‐median problem
2012,
This paper addresses the application of two different grouping‐based algorithms...
Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
2012,
In this paper, we consider the single machine scheduling problem with weighted...
A branch‐and‐cluster coordination scheme for selecting prison facility sites under uncertainty
A branch‐and‐cluster coordination scheme for selecting prison facility sites under uncertainty
2012,
A multi‐period stochastic model and an algorithmic approach to location of...
A branch‐and‐price algorithm for the general case of scheduling parallel machines with a single server
A branch‐and‐price algorithm for the general case of scheduling parallel machines with a single server
2012,
We consider the strongly NP‐hard problem of scheduling two‐operation...
Papers per page: