Keyword: combinatorial analysis

Found 435 papers in total
An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint
An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint
2007,
This paper studies the two-machine permutation flowshop scheduling problem with...
Single machine scheduling problems with resource dependent release times
Single machine scheduling problems with resource dependent release times
2007,
We consider two single machine scheduling problems with resource dependent release...
Flow shop scheduling problems with decreasing linear deterioration under dominant machines
Flow shop scheduling problems with decreasing linear deterioration under dominant machines
2007,
This paper considers the general, no-wait and no-idle flow shop scheduling problems...
Complexity of two dual criteria scheduling problems
Complexity of two dual criteria scheduling problems
2007,
In this article we answer the complexity question of two dual criteria scheduling...
Flexibility and complexity in periodic distribution problems
Flexibility and complexity in periodic distribution problems
2007,
In this paper, we explore trade-offs between operational flexibility and operational...
A two-step optimization approach for technology selection
A two-step optimization approach for technology selection
2006,
An efficient optimization approach for the technology selection problem is described....
An object-based evolutionary algorithm for solving nesting problems
An object-based evolutionary algorithm for solving nesting problems
2007,
This paper presents a new methodology, object-based evolutionary algorithm (OBEA),...
Algorithms for the multi-item multi-vehicles dynamic lot sizing problem
Algorithms for the multi-item multi-vehicles dynamic lot sizing problem
2006,
We consider a two-stage supply chain, in which multi-items are shipped from a...
Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints
Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints
2006,
This paper addresses a two-machine open shop scheduling problem, in which the machines...
A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities
A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities
2006,
This paper presents a branch-and-price algorithm for scheduling n jobs on m...
A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
2006,
The quay crane scheduling problem consists of determining a sequence of unloading and...
Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
2006,
In this paper, we study the problem of scheduling quay cranes at container terminals...
Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
2006,
We consider the problem of scheduling orders on identical machines in parallel. Each...
Short-term capacity allocation problem with tool and setup constraints
Short-term capacity allocation problem with tool and setup constraints
2005,
We consider a short-term capacity allocation problem with tool and setup constraints...
Mining relevant information on the Web: a clique-based approach
Mining relevant information on the Web: a clique-based approach
2006,
The role of information management and retrieval in production processes has been...
A new encoding based genetic algorithm for the traveling salesman problem
A new encoding based genetic algorithm for the traveling salesman problem
2006,
The combination of genetic algorithm and local search has been shown to be an...
Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization
Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization
2006,
A memetic meta-heuristic called the shuffled frog-leaping algorithm (SFLA) has been...
An empirical comparison of Tabu Search, Simulated Annealing, and Genetic Algorithms for facilities location problems
An empirical comparison of Tabu Search, Simulated Annealing, and Genetic Algorithms for facilities location problems
2006,
Algorithms to solve Facility Location Problems (FLP) optimally suffer from...
Job ordering and management of wearing tools
Job ordering and management of wearing tools
2006,
This article considers a scheduling problem arising in flexible manufacturing systems....
A method for improving the resolution of active and passive balancing schemes for disk drives
A method for improving the resolution of active and passive balancing schemes for disk drives
2006,
Some of the current imbalance compensation methods used in hard disk drives are based...
Basic scheduling problems with raw material constraints
Basic scheduling problems with raw material constraints
2005,
One of the achievements of scheduling theory is its contribution to practical...
Exact algorithms for the Hamiltonian cycle problem in planar graphs
Exact algorithms for the Hamiltonian cycle problem in planar graphs
2006,
We construct an exact algorithm for the Hamiltonian cycle problem in planar graphs...
A (1−1/e)-approximation algorithm for the generalized assignment problem
A (1−1/e)-approximation algorithm for the generalized assignment problem
2006,
We give a (1− 1/ e )-approximation algorithm for the max-profit generalized...
Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
2005,
We address the weighted max-cut problem, or equivalently the problem of maximizing a...
Papers per page: