Book ChapterDOI
A New Exact Solution Algorithm for the Job Shop Problem with Sequence-Dependent Setup Times
Christian Artigues,S. Belmokhtar,Dominique Feillet +2 more
- pp 37-49
Reads0
Chats0
TLDR
This work investigates a relaxation of the problem related to the traveling salesman problem with time windows (TSPTW), based on a Branch and Bound procedure, including constraint propagation, and compares favorably over the best available approaches from the literature on a set of benchmark instances.Abstract:
We propose a new solution approach for the Job Shop Problem with Sequence Dependent Setup Times (SDST-JSP) The problem consists in scheduling jobs, each job being a set of elementary operations to be processed on different machines The objective pursued is to minimize the completion time of the set of operations We investigate a relaxation of the problem related to the traveling salesman problem with time windows (TSPTW) Our approach is based on a Branch and Bound procedure, including constraint propagation and using this relaxation It compares favorably over the best available approaches from the literature on a set of benchmark instancesread more
Citations
More filters
Journal ArticleDOI
A survey of scheduling problems with setup times or costs
TL;DR: An extensive review of the scheduling literature on models with setup times (costs) from then to date covering more than 300 papers is provided, which classifies scheduling problems into those with batching and non-batching considerations, and with sequence-independent and sequence-dependent setup times.
Journal ArticleDOI
A branch and bound method for the job-shop problem with sequence-dependent setup times
TL;DR: A new method to solve the makespan minimization problem to optimality is proposed based on iterative solving via branch and bound decisional versions of the problem, which allows to close previously unsolved benchmark instances of the literature and also provides new lower and upper bounds.
Journal ArticleDOI
Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times
TL;DR: This paper extends a genetic algorithm and a local search method that demonstrated to be efficient in solving the Job Shop Scheduling Problem with Sequence Dependent Setup Times (SDST-JSP), and formalized neighborhood structures that generalize three well-know structures defined for the JSP.
Journal ArticleDOI
A review on job shop scheduling with setup times
TL;DR: In this paper, the authors provide a comprehensive review of the literature on job shop scheduling problems with setup times, including non-batch (job) setup times and batch setup times.
MonographDOI
Solving TSP with Time Windows with Constraints
TL;DR: In this article, a set of techniques for solving the Travelling Salesman Problem with Time Windows (TSPTW) with constraints are presented, based on two views of the TSPTW, i.e., TSP and a scheduling problem.
References
More filters
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.
Journal ArticleDOI
A Fast Taboo Search Algorithm for the Job Shop Problem
TL;DR: A fast and easily implementable approximation algorithm for the problem of finding a minimum makespan in a job shop is presented, based on a taboo search technique with a specific neighborhood definition which employs a critical path and blocks of operations notions.
Journal ArticleDOI
An algorithm for solving the job-shop problem
Jacques Carlier,Eric Pinson +1 more
TL;DR: 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.
Journal ArticleDOI
The Job Shop Scheduling Problem: Conventional and new Solution Techniques
TL;DR: A job shop consists of a set of different machines that perform operations on jobs, each job is composed of an ordered list of operations each of which is determined by the machine required and the processing time on it.
Book
Constraint - based scheduling : applying constraint programming to scheduling problems
TL;DR: This book is to provide an overview of the most widely used Constraint-Based Scheduling techniques and provides a model of the constraints that are the most often encountered in scheduling problems.
Related Papers (5)
A branch & bound method for the general-shop problem with sequence dependent setup-times
Peter Brucker,Olaf Thiele +1 more
Using Genetic Algorithms and Heuristics for Job Shop Scheduling with Sequence-Dependent Setup Times
Waiman Cheung,Hong Zhou +1 more