Journal: Computers and Operations Research

Found 2748 papers in total
Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
2005,
A critical event tabu search method which navigates both sides of the feasibility...
An exact algorithm for the knapsack sharing problem
An exact algorithm for the knapsack sharing problem
2005,
In this paper, we develop an exact algorithm for solving the knapsack sharing problem....
A line up evolutionary algorithm for solving nonlinear constrained optimization problems
A line up evolutionary algorithm for solving nonlinear constrained optimization problems
2005,
In this work a complete framework is presented for solving nonlinear constrained...
On the multi-product newsboy problem with two constraints
On the multi-product newsboy problem with two constraints
2005,
There is a growing interest in the applications of the constrained multi-product...
An effective hybrid algorithm for the problem of packing circles into a larger containing circle
An effective hybrid algorithm for the problem of packing circles into a larger containing circle
2005,
Simulated annealing is a powerful stochastic search method, but it still has the...
Solving the uncapacitated hub location problem using genetic algorithms
Solving the uncapacitated hub location problem using genetic algorithms
2005,
Hub location problems are widely studied in the area of location theory, where they...
A branch-and-price approach to p-median location problems
A branch-and-price approach to p-median location problems
2005,
This paper describes a branch-and-price algorithm for the p -median location problem....
Replacement and standby redundancy policies in a deteriorating system with aging and random shocks
Replacement and standby redundancy policies in a deteriorating system with aging and random shocks
2005,
This study investigates the state-dependent maintenance policy in a multistate...
Where are the hard knapsack problems?
Where are the hard knapsack problems?
2005,
The knapsack problem is believed to be one of the “easier” NP -hard...
Aggregate production planning for a continuous reconfigurable manufacturing process
Aggregate production planning for a continuous reconfigurable manufacturing process
2005,
Most of the research on aggregate production planning has been focused on discrete...
Single-point stochastic search algorithms for the multi-level lot-sizing problem
Single-point stochastic search algorithms for the multi-level lot-sizing problem
2005,
Among the most common decisions in manufacturing and distribution companies are...
Evaluating failure time probabilities for a Markovian wear process
Evaluating failure time probabilities for a Markovian wear process
2005,
We present simplified analytical results for the numerical evaluation of failure time...
An efficient heuristic for series–parallel redundant reliability problems
An efficient heuristic for series–parallel redundant reliability problems
2005,
This paper presents a novel algorithm for solving a series–parallel redundancy...
Risk assessment for build–operate–transfer projects: a dynamic multi-objective programming approach
Risk assessment for build–operate–transfer projects: a dynamic multi-objective programming approach
2005,
This study uses a dynamic multi-objective programming approach to establish a risk...
The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
2005,
We consider the single machine module capacitated lot-sizing and scheduling problem...
Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times
Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times
2005,
We consider the single machine parallel-batching scheduling problem with precedence...
Scheduling two-machine no-wait open shops to minimize makespan
Scheduling two-machine no-wait open shops to minimize makespan
2005,
This paper examines the problem of scheduling two-machine no-wait open shops to...
Mixed binary integer programming formulations for the reentrant job shop scheduling problem
Mixed binary integer programming formulations for the reentrant job shop scheduling problem
2005,
This paper describes the development of mixed binary integer programming (BIP)...
Comparison of heuristics for flowtime minimisation in permutation flowshops
Comparison of heuristics for flowtime minimisation in permutation flowshops
2005,
In this paper, we address the problem of sequencing jobs in a permutation flow shop...
Beam-ACO – hybridizing ant colony optimization with beam search: an application to open shop scheduling
Beam-ACO – hybridizing ant colony optimization with beam search: an application to open shop scheduling
2005,
Ant colony optimization (ACO) is a metaheuristic approach to tackle hard combinatorial...
A computational study of the permutation flow shop problem based on a tight lower bound
A computational study of the permutation flow shop problem based on a tight lower bound
2005,
We consider the classical permutation flow shop problem which requires scheduling n...
Earliness–tardiness scheduling with setup considerations
Earliness–tardiness scheduling with setup considerations
2005,
The one-machine scheduling problem with sequence-dependent setup times and costs and...
The complexity of customer order scheduling problems on parallel machines
The complexity of customer order scheduling problems on parallel machines
2005,
This paper considers scheduling problems where a set of jobs (customer order) is...
Parallel machine selection and job scheduling to minimize machine cost and job tardiness
Parallel machine selection and job scheduling to minimize machine cost and job tardiness
2005,
This paper discussed the problem of simultaneously selecting and scheduling parallel...
Papers per page: