Results 1  10
of
57
Benchmarks for Basic Scheduling Problems
, 1989
"... In this paper, we propose 260 scheduling problems whose size is greater than that of the rare examples published. Such sizes correspond to real dimensions of industrial problems. ..."
Abstract

Cited by 152 (0 self)
 Add to MetaCart
In this paper, we propose 260 scheduling problems whose size is greater than that of the rare examples published. Such sizes correspond to real dimensions of industrial problems.
Nonsystematic Backtracking Search
, 1995
"... Many practical problems in Artificial Intelligence have search trees that are too large to search exhaustively in the amount of time allowed. Systematic techniques such as chronological backtracking can be applied to these problems, but the order in which they examine nodes makes them unlikely to fi ..."
Abstract

Cited by 55 (1 self)
 Add to MetaCart
Many practical problems in Artificial Intelligence have search trees that are too large to search exhaustively in the amount of time allowed. Systematic techniques such as chronological backtracking can be applied to these problems, but the order in which they examine nodes makes them unlikely to find a solution in the explored fraction of the space. Nonsystematic techniques have been proposed to alleviate the problem by searching nodes in a random order. A technique known as iterative sampling follows random paths from the root of the tree to the fringe, stopping if a path ends at a goal node. Although the nonsystematic techniques do not suffer from the problem of exploring nodes in a bad order, they do reconsider nodes they have already ruled out, a problem that is serious when the density of solutions in the tree is low. Unfortunately, for many practical problems the order of examing nodes matters and the density of solutions is low. Consequently, neither chronological backtracking...
Applying Constraint Satisfaction Techniques to Job Shop Scheduling
, 1995
"... In this paper, we investigate the applicability of a constraint satisfaction problem solving (CSP) model, recently developed for deadline scheduling, to more commonly studied problems of schedule optimization. Our hypothesis is twofold: (1) that CSP scheduling techniques provide a basis for develop ..."
Abstract

Cited by 42 (9 self)
 Add to MetaCart
In this paper, we investigate the applicability of a constraint satisfaction problem solving (CSP) model, recently developed for deadline scheduling, to more commonly studied problems of schedule optimization. Our hypothesis is twofold: (1) that CSP scheduling techniques provide a basis for developing highperformance approximate solution procedures in optimization contexts, and (2) that the representational assumptions underlying CSP models allow these procedures to naturally accommodate the idiosyncratic constraints that complicate most realworld applications. We focus specifically on the objective criterion of makespan minimization, which has received the most attention within the job shop scheduling literature. We define an extended solution procedure somewhat unconventionally by reformulating the makespan problem as one of solving a series of different but related deadline scheduling problems, and embedding a simple CSP procedure as the subproblem solver. We first present the re...
Towards a Taxonomy of Parallel Tabu Search Heuristics
, 1997
"... In this paper we present a classification of parallel tabu search metaheuristics based, on the one hand, on the control and communication strategies used in the design of the parallel tabu search procedures and, on the other hand, on how the search space is partitionned. These criteria are then used ..."
Abstract

Cited by 41 (8 self)
 Add to MetaCart
In this paper we present a classification of parallel tabu search metaheuristics based, on the one hand, on the control and communication strategies used in the design of the parallel tabu search procedures and, on the other hand, on how the search space is partitionned. These criteria are then used to review the parallel tabu search implementations described in the literature. The taxonomy is further illustrated by the results of several parallelization implementations of a tabu search procedure for multicommodity locationallocation problems with balancing requirements. Key words: Tabu search metaheuristics, Parallelization strategies, Taxonomy R'esum'e Nous pr'esentons un sch'ema de classification des algorithmes parall`eles de recherche avec tabous. La taxonomie est bas'ee, d'une part, sur les strat'egies de controle et de communication des algorithmes parall`eles de recherche avec tabous et, d'autre part, sur les r`egles de partitionnement du domaine. Ces crit`eres sont ensuite...
Parallel Grasp With PathRelinking For Job Shop Scheduling
 Parallel Computing
, 2002
"... In the job shop scheduling problem (JSP), a finite set of jobs is processed on a finite set of machines. Each job is required to complete a set of operations in a fixed order. Each operation is processed on a specific machine for a fixed duration. A machine can process no more than one job at a ..."
Abstract

Cited by 34 (16 self)
 Add to MetaCart
In the job shop scheduling problem (JSP), a finite set of jobs is processed on a finite set of machines. Each job is required to complete a set of operations in a fixed order. Each operation is processed on a specific machine for a fixed duration. A machine can process no more than one job at a time and once a job initiates processing on a given machine it must complete processing without interruption. A schedule is an assignment of operations to time slots on the machines. The objective of the JSP is to find a schedule that minimizes the maximum completion time, or makespan, of the jobs. In this paper, we describe a parallel greedy randomized adaptive search procedure (GRASP) with pathrelinking for the JSP. A GRASP is a metaheuristic for combinatorial optimization. It usually consists of a construction procedure based on a greedy randomized algorithm and of a local search. Pathrelinking is an intensification strategy that explores trajectories that connect high quality solutions. Independent and cooperative parallelization strategies are described and implemented. Computational experience on a large set of standard test problems indicates that the parallel GRASP with pathrelinking finds goodquality approximate solutions of the job shop scheduling problem.
A Hybrid Genetic Algorithm for the Job Shop Scheduling Problem
 EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
, 2002
"... This paper presents a hybrid genetic algorithm for the Job Shop Scheduling problem. The chromosome representation of the problem is based on random keys. The schedules are constructed using a priority rule in which the priorities are defined by the genetic algorithm. Schedules are constructed using ..."
Abstract

Cited by 28 (8 self)
 Add to MetaCart
This paper presents a hybrid genetic algorithm for the Job Shop Scheduling problem. The chromosome representation of the problem is based on random keys. The schedules are constructed using a priority rule in which the priorities are defined by the genetic algorithm. Schedules are constructed using a procedure that generates parameterized active schedules. After a schedule is obtained a local search heuristic is applied to improve the solution. The approach is tested on a set of standard instances taken from the literature and compared with other approaches. The computation results validate the effectiveness of the proposed algorithm.
Adaptive Memory Programming: A Unified View of Metaheuristics
, 1998
"... The paper analyses recent developments of a number of memorybased metaheuristics such as taboo search, scatter search, genetic algorithms and ant colonies. It shows that the implementations of these general solving methods are more and more similar. So, a unified presentation is proposed under the ..."
Abstract

Cited by 27 (3 self)
 Add to MetaCart
The paper analyses recent developments of a number of memorybased metaheuristics such as taboo search, scatter search, genetic algorithms and ant colonies. It shows that the implementations of these general solving methods are more and more similar. So, a unified presentation is proposed under the name of Adaptive Memory Programming (AMP). A number of methods recently developed for the quadratic assignment, vehicle routing and graph colouring problems are reviewed and presented under the adaptive memory programming point of view. AMP presents a number of interesting aspects such as a high parallelization potential and the ability of dealing with real and dynamic applications.
ConstraintBased Optimization and Approximation for JobShop Scheduling
 In Proceedings of the AAAISIGMAN Workshop on Intelligent Manufacturing Systems, IJCAI95
, 1995
"... We present constraintbased optimization algorithms and a constraintbased approximation algorithm for the jobshop scheduling problem. An empirical performance analysis shows that both the optimization algorithms and the approximation algorithm perform well. Especially the approximation algorith ..."
Abstract

Cited by 24 (2 self)
 Add to MetaCart
We present constraintbased optimization algorithms and a constraintbased approximation algorithm for the jobshop scheduling problem. An empirical performance analysis shows that both the optimization algorithms and the approximation algorithm perform well. Especially the approximation algorithm is among the best algorithms known to date. We, furthermore, show that we can improve the performance of the optimization algorithms by combining them with the approximation algorithm.
JobShop Scheduling by Simulated Annealing Combined with Deterministic Local Search
, 1995
"... : The JobShop Scheduling Problem (JSSP) is one of the most difficult NPhard combinatorial optimization problems. This paper proposes a new method for solving JSSPs based on simulated annealing (SA), a stochastic local search, enhanced by shifting bottleneck (SB), a problem specific deterministi ..."
Abstract

Cited by 23 (6 self)
 Add to MetaCart
: The JobShop Scheduling Problem (JSSP) is one of the most difficult NPhard combinatorial optimization problems. This paper proposes a new method for solving JSSPs based on simulated annealing (SA), a stochastic local search, enhanced by shifting bottleneck (SB), a problem specific deterministic local search. In our method new schedules are generated by a variant of Giffler and Thompson's active scheduler with operation permutations on the critical path. SA selects a new schedule and probabilistically accepts or rejects it. The modified SB is applied to repair the rejected schedule; the new schedule is accepted if an improvement is made. Experimental results showed the proposed method found near optimal schedules for the difficult benchmark problems and outperformed other existing local search algorithms. Key Words: Simulated annealing, shifting bottleneck, jobshop scheduling, heuristics, local search 1. Background Scheduling is allocating shared resources over time to competi...