Keyword: combinatorial optimization

Found 3184 papers in total
Fitness landscape analysis for the no‐wait flow‐shop scheduling problem
Fitness landscape analysis for the no‐wait flow‐shop scheduling problem
2012,
The fitness landscape of the no‐wait (continuous) flow‐shop scheduling...
A tabu search heuristic procedure for the capacitated facility location problem
A tabu search heuristic procedure for the capacitated facility location problem
2012,
A tabu search heuristic procedure is developed, implemented and computationally tested...
The balanced academic curriculum problem revisited
The balanced academic curriculum problem revisited
2012,
The Balanced Academic Curriculum Problem (BACP) consists in assigning courses to...
A mathematical model and a metaheuristic approach for a memory allocation problem
A mathematical model and a metaheuristic approach for a memory allocation problem
2012,
Memory allocation in embedded systems is one of the main challenges that electronic...
An Approximation Algorithm for a Large‐Scale Facility Location Problem
An Approximation Algorithm for a Large‐Scale Facility Location Problem
2003,
We developed a new practical optimization method that gives approximate solutions for...
Finding a Region with the Minimum Total L 1 Distance from Prescribed Terminals
Finding a Region with the Minimum Total L 1 Distance from Prescribed Terminals
2003,
Given k terminals and n axis‐parallel rectangular obstacles on the plane, our...
Competitive On‐Line Switching Policies
Competitive On‐Line Switching Policies
2003,
Consider the following problem. A switch connecting n input channels to a single...
Temporary Tasks Assignment Resolved
Temporary Tasks Assignment Resolved
2003,
Among all basic on‐line load balancing problems, the only unresolved problem...
The Buffer Tree: A Technique for Designing Batched External Data Structures
The Buffer Tree: A Technique for Designing Batched External Data Structures
2003,
We present a technique for designing external memory data structures that support...
Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation
Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation
2003,
This paper presents a new algorithm for computing the maximum degree δk (A) of a...
Escaping a Grid by Edge‐Disjoint Paths
Escaping a Grid by Edge‐Disjoint Paths
2003,
We present a technique for designing external memory data structures that support...
A discrete time exact solution approach for a complex hybrid flow‐shop scheduling problem with limited‐wait constraints
A discrete time exact solution approach for a complex hybrid flow‐shop scheduling problem with limited‐wait constraints
2012,
We study a real‐world complex hybrid flow‐shop scheduling problem...
Single‐machine makespan minimization scheduling with nonlinear shortening processing times
Single‐machine makespan minimization scheduling with nonlinear shortening processing times
2012,
In this paper, we consider the single‐machine makespan minimization scheduling...
An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
2012,
The cumulative capacitated vehicle routing problem (CCVRP) is a variation of the...
Performance evaluation of a synchronization station with multiple inputs and population constraints
Performance evaluation of a synchronization station with multiple inputs and population constraints
2012,
Synchronization stations are commonly used to model kitting operations in...
Simulated annealing for optimal ship routing
Simulated annealing for optimal ship routing
2012,
In this article we present a simulated annealing based algorithm for the determination...
Batch scheduling on uniform machines to minimize total flow‐time
Batch scheduling on uniform machines to minimize total flow‐time
2012,
The solution of the classical batch scheduling problem with identical jobs and setup...
The dynamic space allocation problem: Applying hybrid GRASP and Tabu search metaheuristics
The dynamic space allocation problem: Applying hybrid GRASP and Tabu search metaheuristics
2012,
This work is devoted to the Dynamic Space Allocation Problem, where project duration...
A Lagrangian approach for minimum cost single round robin tournaments
A Lagrangian approach for minimum cost single round robin tournaments
2012,
Single round robin tournaments are a well known class of sports leagues schedules. We...
Two‐stage hybrid flow shop with precedence constraints and parallel machines at second stage
Two‐stage hybrid flow shop with precedence constraints and parallel machines at second stage
2012,
This study deals with the two‐stage hybrid flow shop (HFS) problem with...
Branch‐and‐bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
Branch‐and‐bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
2012,
In this paper, we consider a single‐machine scheduling problem with release...
Single‐machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time
Single‐machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time
2012,
In this paper, we consider single‐machine scheduling problem in which...
Heuristic approaches for master planning in semiconductor manufacturing
Heuristic approaches for master planning in semiconductor manufacturing
2012,
In this paper, we propose heuristic approaches for solving master planning problems...
Time‐Constrained Scheduling of Weighted Packets on Trees and Meshes
Time‐Constrained Scheduling of Weighted Packets on Trees and Meshes
2003,
The time‐constrained packet routing problem is to schedule a set of packets to...
Papers per page: