Keyword: heuristics

Found 5460 papers in total
A heuristic for the two-machine open-shop scheduling problem with transportation times
A heuristic for the two-machine open-shop scheduling problem with transportation times
1999,
The paper considers a problem of scheduling n jobs in a two-machine open shop to...
List schedules for cyclic scheduling
List schedules for cyclic scheduling
1999,
This paper addresses the definition and properties of list scheduling in the context...
Discrete–continuous scheduling to minimize the makespan for power processing rates of jobs
Discrete–continuous scheduling to minimize the makespan for power processing rates of jobs
1999,
A class of discrete–continuous scheduling problems is considered when each...
A branch and bound based heuristic for multi-product resource constrained scheduling problem in a flexible manufacturing system environment
A branch and bound based heuristic for multi-product resource constrained scheduling problem in a flexible manufacturing system environment
1999,
This paper addresses an inter-dependent multiple-product resource-constrained...
Heuristics for scheduling in a flow shop with multiple processors
Heuristics for scheduling in a flow shop with multiple processors
1999,
This study investigates the performance of scheduling heuristics in a flow shop with...
Exploiting process plan flexibility in production scheduling: A multi-objective approach
Exploiting process plan flexibility in production scheduling: A multi-objective approach
1999,
When solving a product/process design problem, we must exploit the available degrees...
Bounds for the position of the smallest job in completion time variance minimization
Bounds for the position of the smallest job in completion time variance minimization
1999,
The problem of scheduling jobs on a single machine so as to minimize the variance of...
Scheduling to minimize product design time using a genetic algorithm
Scheduling to minimize product design time using a genetic algorithm
1999,
We consider a scheduling problem encountered in a semiconductor manufacturing company...
A tabu search algorithm for the vehicle routing problem
A tabu search algorithm for the vehicle routing problem
1999,
The purpose of this study is to develop a new tabu search heuristic to solve the...
A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
1999,
We consider an extension of the capacitated Vehicle Routing Problem (VRP), known as...
Optimum multicast of multimedia streams
Optimum multicast of multimedia streams
1999,
In a VOD system, multicast is a preferred method for saving network bandwidth, That...
Tighter relaxations for the cutting stock problem
Tighter relaxations for the cutting stock problem
1999,
In the cutting stock problem (CSP) a given order for smaller pieces has to be cut from...
A hierarchical approach for one-dimensional cutting stock problems in the steel industry that maximizes yield and minimizes overgrading
A hierarchical approach for one-dimensional cutting stock problems in the steel industry that maximizes yield and minimizes overgrading
1999,
In the steel industry, as hot steel products exit the producing facility, they are cut...
The cutting stock problem wih mixed objectives: Two heuristics based on dynamic programming
The cutting stock problem wih mixed objectives: Two heuristics based on dynamic programming
1999,
The purpose of this paper is to provide efficient methods for solving a large spectrum...
A sequential heuristic procedure for one-dimensional cutting
A sequential heuristic procedure for one-dimensional cutting
1999,
The article examines the Sequential Heuristic Procedure for optimising one-dimensional...
Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms
Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms
1999,
In this paper, a hybrid approach, employing both genetic and heuristic algorithms, is...
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...
An LP-based heuristic for two-stage capacitated facility location problems
An LP-based heuristic for two-stage capacitated facility location problems
1999,
In this paper, a linear programming based heuristic is considered for a two-stage...
An efficient procedure for designing single allocation hub and spoke systems
An efficient procedure for designing single allocation hub and spoke systems
1998,
Given the widespread use of the hub and spoke network architecture and its growing...
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...
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...
Match-up scheduling under a machine breakdown
Match-up scheduling under a machine breakdown
1999,
When a machine breakdown forces a modified flow shop (MFS) out of the prescribed...
Papers per page: