1984 search results - page 53 / 397 » The colourful feasibility problem |
ANOR
2008
13 years 10 months ago
2008
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
EOR
2010
13 years 10 months ago
2010
This paper investigates the integration of the employee timetabling and production scheduling problems. At the first level, we manage a classical employee timetabling problem. At ...
IPCO
2007
13 years 11 months ago
2007
Consider the following Steiner Tree leasing problem. Given a graph G = (V, E) with root r, and a sequence of terminal sets Dt ⊆ V for each day t ∈ [T]. A feasible solution to t...
ESA
2009
Springer
14 years 4 months ago
2009
Springer
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
CEC
2008
IEEE
14 years 4 months ago
2008
IEEE
In this paper we introduce an evolutionary algorithm for solving a copper mine planning problem. In the last 10 years this realworld problem has been tackled using linear integer p...