Journal: Computers and Operations Research

Found 2748 papers in total
A variable production scheduling policy for deteriorating items with time-varying demand
A variable production scheduling policy for deteriorating items with time-varying demand
1999,
In this study, an economic production scheduling policy which allows for variations in...
On integrated production-replenishment policies in single-stage manufacturing
On integrated production-replenishment policies in single-stage manufacturing
1999,
This paper simultaneously considers production policies under general time-dependent...
Economic production lot size for deteriorating items taking account of the time-value of money
Economic production lot size for deteriorating items taking account of the time-value of money
1999,
This study applies the discounted cash-flow approach to a deterministic inventory...
Point and expected interval availability analysis with stationarity detection
Point and expected interval availability analysis with stationarity detection
1999,
Interval availability is a dependability measure defined by the fraction of time...
Optimization models for complex recovery block schemes
Optimization models for complex recovery block schemes
1999,
In this paper we consider three complex recovery block schemes: (1) nested recovery...
Tabu search for total tardiness minimization in flowshop scheduling problems
Tabu search for total tardiness minimization in flowshop scheduling problems
1999,
This work addresses the permutation flowshop scheduling problem with the objective of...
Scheduling of parts and robot activities in a two machine robotic cell
Scheduling of parts and robot activities in a two machine robotic cell
1999,
We consider a scheduling problem arising in a two machine flexible robotic cell that...
Generating consensus priority point vectors: A logarithmic goal programming approach
Generating consensus priority point vectors: A logarithmic goal programming approach
1999,
The analytic hierarchy process is a popular technique for addressing multiple-criteria...
Improved heuristics for the n-job single-machine weighted tardiness problem
Improved heuristics for the n-job single-machine weighted tardiness problem
1999,
For the n -job single-machine weighted tardiness problem a priority rule is known,...
Multiple-machine scheduling with earliness, tardiness and completion time penalties
Multiple-machine scheduling with earliness, tardiness and completion time penalties
1999,
We consider the problem of scheduling n jobs on m parallel and identical machines. The...
A tabu search algorithm for the open shop scheduling problem
A tabu search algorithm for the open shop scheduling problem
1999,
An approximation algorithm of finding a minimum makespan in a nonpreemptive open shop...
Early/tardy scheduling with sequence dependent setups on uniform parallel machines
Early/tardy scheduling with sequence dependent setups on uniform parallel machines
1999,
We consider the problem of scheduling N jobs on M parallel machines that operate at...
Heuristics for parallel-machine flexible-resource scheduling problems with unspecified job assignment
Heuristics for parallel-machine flexible-resource scheduling problems with unspecified job assignment
1999,
In this paper, we examine the parallel-machine flexible-resource scheduling problem in...
Earliness penalties on a single machine subject to precedence constraints: Common slack allowance due date assignment
Earliness penalties on a single machine subject to precedence constraints: Common slack allowance due date assignment
1999,
The paper considers the single machine due date assignment and scheduling problems...
An application of data envelopment analysis in telephone offices evaluation with partial data
An application of data envelopment analysis in telephone offices evaluation with partial data
1999,
The presence of partial data motivates the need to investigate how such factors can be...
The critical cut-off value approach for dynamic lot sizing problems with time varying cost parameters
The critical cut-off value approach for dynamic lot sizing problems with time varying cost parameters
1999,
In a dynamic lot sizing problem with time varying cost parameters, a sequence of...
Allocation of demand when cost is demand-dependent
Allocation of demand when cost is demand-dependent
1999,
This paper extends the location-allocation model with continuously distributed demands...
Analysis of a production–inventory system with machine breakdowns and shutdowns
Analysis of a production–inventory system with machine breakdowns and shutdowns
1999,
This paper deals with a production–inventory system which consists of an...
Discrete-time queues with correlated arrivals and constant service times
Discrete-time queues with correlated arrivals and constant service times
1999,
A discrete-time single-server finite-capacity queue with correlated arrivals and...
Applications of modern heuristic search methods to pattern sequencing problems
Applications of modern heuristic search methods to pattern sequencing problems
1999,
This article describes applications of modern heuristic search methods to pattern...
Knowledge-based language for modeling linear programming problems
Knowledge-based language for modeling linear programming problems
1998,
The innovative aspect of this research is to apply knowledge-based methodology to...
Computational comparisons of dual conjugate gradient algorithms for strictly convex networks
Computational comparisons of dual conjugate gradient algorithms for strictly convex networks
1998,
This paper presents a Lagrangian dual conjugate gradient algorithm for solving a...
A hybrid algorithm for solving network flow problems with side constraints
A hybrid algorithm for solving network flow problems with side constraints
1998,
We consider network flow problems with few additional linear side constraints. Three...
A hybrid approach to resolving a differentiable integer program
A hybrid approach to resolving a differentiable integer program
1998,
This paper proposes an algorithm to solve differentiable integer programming problems....
Papers per page: