Journal: Computers and Operations Research

Found 2748 papers in total
Two branch‐and‐bound algorithms for the robust parallel machine scheduling problem
2012,
Uncertainty is an inevitable element in many practical production planning and...
Throughput analysis for order picking system with multiple pickers and aisle congestion considerations
2012,
Most of previous studies in picker‐to‐parts warehousing systems...
A two‐slope achievement scalarizing function for interactive multiobjective optimization
2012,
The use of achievement (scalarizing) functions in interactive multiobjective...
Robust scheduling on a single machine to minimize total flow time
2012,
In a real‐world manufacturing environment featuring a variety of uncertainties,...
On the separation in 2‐period double round robin tournaments with minimum breaks
2012,
This paper considers the separation in 2‐period double round robin tournaments...
Two‐stage hybrid flow shop scheduling with dynamic job arrivals
2012,
Motivated by applications in semiconductor manufacturing industry, we consider a...
A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times
2012,
In this paper, we propose a model for Flexible Job Shop Scheduling Problem (FJSSP)...
A new DSATUR‐based algorithm for exact vertex coloring
2012,
This paper describes a new exact algorithm PASS for the vertex coloring problem based...
Predicting departure times in multi‐stage queueing systems
2012,
We develop an approximation model for the state‐dependent sojourn time...
Scheduling unrelated parallel machines with optional machines and jobs selection
2012,
In this paper we study two generalizations of the well known unrelated parallel...
Some convergence‐based M‐ary cardinal metrics for comparing performances of multi‐objective optimizers
2012,
There is still a big question to the community of multi‐objective optimization:...
The hill detouring method for minimizing hinging hyperplanes functions
2012,
This paper studies the problem of minimizing hinging hyperplanes (HH) which is a...
A hybrid polynomial‐time algorithm for the dynamic quantity discount lot size model with resale
2012,
We propose an efficient optimal algorithm for determining the lot sizes for purchase...
An efficient approach to incorporating interfraction motion in IMRT treatment planning
2012,
Intensity modulated radiation therapy (IMRT) is one of the most widely used delivery...
Problem reduction heuristic for the 0–1 multidimensional knapsack problem
2012,
This paper introduces new problem‐size reduction heuristics for the...
Tree‐decomposition based heuristics for the two‐dimensional bin packing problem with conflicts
2012,
This paper deals with the two‐dimensional bin packing problem with conflicts...
Three‐dimensional container loading models with cargo stability and load bearing constraints
2012,
Mathematical models for the problem of loading rectangular boxes into containers,...
A fuzzy DEA and knapsack formulation integrated model for project selection
2012,
Project selection has become crucial in the fields of science and engineering. This...
A hybrid simulated annealing metaheuristic algorithm for the two‐dimensional knapsack packing problem
2012,
The rectangle knapsack packing problem is to pack a number of rectangles into a larger...
A knapsack problem as a tool to solve the production planning problem in small foundries
2012,
According to recent research carried out in the foundry sector, one of the most...
Reoptimization in Lagrangian methods for the 0–1 quadratic knapsack problem
2012,
The 0–1 quadratic knapsack problem consists of maximizing a quadratic objective...
Iterative semi‐continuous relaxation heuristics for the multiple‐choice multidimensional knapsack problem
2012,
Recently several hybrid methods combining exact algorithms and heuristics have been...
A computational study on the quadratic knapsack problem with multiple constraints
2012,
The quadratic knapsack problem (QKP) has been the subject of considerable research in...
Exact algorithms for the two‐dimensional guillotine knapsack
2012,
The two‐dimensional knapsack problem requires to pack a maximum profit subset...
Papers per page: