Keyword: heuristics

Found 5460 papers in total
A quick and effective metod for capacitated lot sizing with startup and reservation costs
1995,
The authors present a pure zero-one integer programming model for determining...
A heuristic lot scheduling method making use of the optimal schedules’ characters-A study on production ordering system in lot production system
1994,
This paper deals with a heuristic scheduling method for combinatorial ‘lot size...
A microcomputer-based heuristic for tour scheduling of a mixed workforce
1994,
Labor tour scheduling research has recently addressed environments which allow both...
A heuristic scheduling policy for multi-item, multi-machine production systems with time-varying, stochastic demands
1994,
An effective scheduling policy known as the Dynamic Cycle Lengths Heuristic was...
Analysis of classes of heuristics for scheduling a two-stage flow shop with parallel machines at one stage
1995,
This paper addresses two-state flow shop scheduling with parallel machines at one...
A tabu search heuristic for the vehicle routing problem
1994,
The purpose of this paper is to describe TABUROUTE, a new tabu search heuristic for...
A parallel implementation of the Tabu search heuristic for Vehicle Routing Problems with Time Window constraints
1994,
This paper describes a parallel Tabu search heuristic for the Vehicle Routing Problem...
A capacitated General Routing Problem on mixed networks
1995,
This study addresses the problem of routing vehicles over the specified segments of a...
Algorithms for the Chinese postman problem on mixed networks
1995,
The Chinese postman problem on mixed networks (MCPP), is a practical generalization of...
A new heurisic for the period traveling salesman problem
1995,
In this paper, a new heuristic for the period traveling salesman problem is presented....
The Split Delivery Vehicle Scheduling Problem with Time Windows and grid network distances
1995,
The authors consider an extension of the Split Delivery Vehicle Routing Problem,...
Performance of two heuristics for solving large scale two-dimensional guillotine cutting problems
1995,
The two dimensional cutting problem consists of cutting a rectangular plate into...
A vehicle fleet system with multi-objective optimization
1994,
Many vehicle fleet planning systems have been suggested to minimize the routing...
On the k-coloring problem
1994,
A fixed k- coloring problem is introduced and dealt with by efficient heuristic...
Easing the conscience of the guilty net
1994,
This article deals with dynamical system neural networks which find for given vertices...
A stability concept for zero-one knapsack problems and approximation algorithms
1995,
The concept of reducing the feasible range of decision variables or fixing the value...
Solving transportation problems with nonlinear side constraints with tabu search
1995,
An algorithm based on tabu search ideas is developed to solve transportation problems...
Capacitated multiple item ordering with incremental quantity discounts
1994,
This paper presents a heuristic algorithm for determining order quantities for...
Configuring cellular manufacturing systems: A quadratic integer programming formulation and a simple interchange heuristic
1995,
The first step towards implementing Group Technology in manufacturing is the...
A heuristic scheduling algorithm for improving the duration and net present value of a project
1995,
This paper proposes a heuristic iterative scheduling algorithm for the resource...
Net-present-value cost/time tradeoff
1995,
Cost/time tradeoff (CTTO) is used to increase the net benefit of a project by crashing...
Impact of family-based scheduling on transfer batches in a job shop manufacturing cell
1994,
Past research has shown that the performance of manufacturing cells can be improved if...
Effective job shop scheduling through active chain manipulation
1995,
A practical yet effective heuristic algorithm is developed in this paper for solving...
Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs
1995,
The authors consider a single-machine scheduling problem in which every job has a...
Papers per page: