175 search results - page 7 / 35 » Approximation Algorithms for Flexible Job Shop Problems |
EOR
2006
13 years 7 months ago
2006
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedu...
MP
2002
13 years 7 months ago
2002
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
CAV
2001
Springer
14 years 1 days ago
2001
Springer
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Artificial immune system can be used to generate schedules in changing environments and it has been proven to be more robust than schedules developed using a genetic algorithm. Go...
JAIR
2007
13 years 7 months ago
2007
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a novel constructive search technique that performs a series of resource-limited tree searches where each search begins...