Keyword: heuristics

Found 5460 papers in total
Efficient neighborhood search for the one-machine earliness–tardiness scheduling problem
2006,
This paper addresses the one-machine scheduling problem where the objective is to...
The routing open-shop problem on a network: Complexity and approximation
2006,
In the routing open-shop problem, jobs are located at nodes of an undirected...
Heuristics and augmented neural networks for task scheduling with non-identical machines
2006,
We propose new heuristics along with an augmented-neural-network (AugNN) formulation...
Aversion scheduling in the presence of risky jobs
2006,
Empirical studies have shown that human schedulers use special procedures to deal with...
Algorithms for single machine total tardiness scheduling with sequence dependent setups
2006,
We consider the problem of scheduling a single machine to minimize total tardiness...
The multiple-job repair kit problem
2006,
The repair kit problem is that of finding the optimal set of parts in the kit of a...
A hybrid algorithm for solving the economic lot and delivery scheduling problem in the common cycle case
2006,
The ELDSP problem is a combined lot sizing and sequencing problem. A supplier produces...
A note on makespan minimization in two-stage flexible flow shops with uniform machines
2006,
We consider the two-stage flexible flow shop makespan minimization problem with...
Real-time routing in flexible flow shops: a self-adaptive swarm-based control model
2007,
This paper presents a self-adaptive, swarm-based control model for real-time part...
A heuristic algorithm for master planning that satisfies multiple objectives
2007,
This study proposes a heuristic algorithm, called the multi-objective master planning...
A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
2006,
In this paper we present a new insertion-based construction heuristic to solve the...
Scheduling advertisements on a Web page to maximize revenue
2006,
Many Web sites (e.g. Hotmail, Yahoo) provide free services to the users while...
Bi-criteria food packing by dynamic programming
2007,
In this paper, we deal with a certain type of automated food packing system with n...
Multi-period capacity expansion for a local access telecommunications network
2006,
In this paper, we examine a multi-period capacity expansion problem for a local access...
A new heuristic algorithm for rectangle packing
2007,
The rectangle packing problem often appears in encasement and cutting as well as very...
Heuristics for a dynamic rural postman problem
2007,
This paper presents a very special cutting path determination problem appearing in a...
Heuristics to the cutting of unidimensional integer stock problem
2006,
One-dimensional cutting stock problems consist of cutting standard objects available...
A computational study of local search algorithms for Italian high-school timetabling
2007,
In this paper we report on a computational experience with a local search algorithm...
A strategic, area-wide contingency planning model for oil spill cleanup operations with application demonstrated to the Galveston Bay Area
1996,
This paper develops a general integer programming model for strategic, area-wide...
Decomposition heuristics for minimizing earliness–tardiness on parallel burn-in ovens with a common due date
2007,
This paper considers a scheduling problem for parallel burn-in ovens in the...
Particle Swarm Optimization-based algorithm for home care worker scheduling in the UK
2007,
This paper presents the novel application of a collaborative population-based...
Simultaneously determining the mix of space launch vehicles and the assignment of satellites to rockets
2006,
The manifest problem is faced by aerospace firms that produce launch vehicles to shoot...
Scheduling sports competitions at multiple venues – Revisited
2006,
In this work, we study scheduling sports competitions at multiple venues, a problem...
A heuristic algorithm to minimize the number of crews allocated in an airlift operation
1990,
In this paper, we solve the problem of minimizing the number of crews required for...
Papers per page: