Journal ArticleDOI
An algorithm for solving the job-shop problem
Jacques Carlier,Eric Pinson +1 more
Reads0
Chats0
TLDR
In this paper, a branch and bound method for solving the job-shop problem is proposed, which is based on one-machine scheduling problems and is made more efficient by several propositions which limit the search tree by using immediate selections.Abstract:
In this paper, we propose a branch and bound method for solving the job-shop problem. It is based on one-machine scheduling problems and is made more efficient by several propositions which limit the search tree by using immediate selections.
It solved for the first time the famous 10 × 10 job-shop problem proposed by Muth and Thompson in 1963.read more
Citations
More filters
Proceedings ArticleDOI
Chaff: engineering an efficient SAT solver
TL;DR: The development of a new complete solver, Chaff, is described which achieves significant performance gains through careful engineering of all aspects of the search-especially a particularly efficient implementation of Boolean constraint propagation (BCP) and a novel low overhead decision strategy.
Journal ArticleDOI
Benchmarks for basic scheduling problems
TL;DR: This paper proposes 260 randomly generated scheduling problems whose size is greater than that of the rare examples published, and the objective is the minimization of the makespan.
Book
Handbook of Constraint Programming
TL;DR: Researchers from other fields should find in this handbook an effective way to learn about constraint programming and to possibly use some of the constraint programming concepts and techniques in their work, thus providing a means for a fruitful cross-fertilization among different research areas.
Journal ArticleDOI
Resource-constrained project scheduling: Notation, classification, models, and methods
TL;DR: A classification scheme is provided, i.e. a description of the resource environment, the activity characteristics, and the objective function, respectively, which is compatible with machine scheduling and which allows to classify the most important models dealt with so far, and a unifying notation is proposed.
Journal ArticleDOI
Job Shop Scheduling by Simulated Annealing
TL;DR: In this article, an approximation algorithm for the problem of finding the minimum makespan in a job shop is presented, which is based on simulated annealing, a generalization of the well known iterative improvement approach to combinatorial optimization problems.
References
More filters
Book
Introduction to sequencing and scheduling
TL;DR: In this article, the authors present an introduction to Sequencing and Scheduling in the context of the Operational Research Society (ORS) and the International Journal of Distributed Sensor Networks (ILS).
Journal ArticleDOI
On a routing problem
TL;DR: Given a set of N cities, with every two linked by a road, and the times required to traverse these roads, the functional equation technique of dynamic programming and approximation in policy space yield an iterative algorithm which converges after at most (N-1) iterations.
Book ChapterDOI
Complexity of machine scheduling problems
TL;DR: In this paper, the authors survey and extend the results on the complexity of machine scheduling problems and give a classification of scheduling problems on single, different and identical machines and study the influence of various parameters on their complexity.
Journal ArticleDOI
The Shifting Bottleneck Procedure for Job Shop Scheduling
TL;DR: An approximation method for solving the minimum makespan problem of job shop scheduling by sequences the machines one by one, successively, taking each time the machine identified as a bottleneck among the machines not yet sequenced.
Book
Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop
TL;DR: In this article, an introduction to the mathematics of the job shop is presented, with a focus on the sequential and scheduling aspects of the system. But this approach is not suitable for all job-shop scenarios.