A branch and bound method for the job-shop problem with sequence-dependent setup times
From MaRDI portal
Publication:940884
DOI10.1007/s10479-007-0283-0zbMath1152.90424OpenAlexW1968822565MaRDI QIDQ940884
Dominique Feillet, Christian Artigues
Publication date: 3 September 2008
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-007-0283-0
dynamic programmingbranch and boundconstraint propagationsequence-dependent setup timesjob-shop scheduling
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items
Job shop scheduling with setup times, deadlines and precedence constraints ⋮ Group-shop scheduling with sequence-dependent set-up and transportation times ⋮ A numerical method for interval multi-objective mixed-integer optimal control problems based on quantum heuristic algorithm ⋮ Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search ⋮ Scatter search with path relinking for the job shop with time lags and setup times ⋮ An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ Depth-first heuristic search for the job shop scheduling problem ⋮ Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP) ⋮ Optimization of the integrated problem of employee timetabling and job shop scheduling ⋮ An 11/7 — Approximation Algorithm for Single Machine Scheduling Problem with Release and Delivery Times ⋮ Scheduling Algorithms for Single Machine Problem with Release and Delivery Times ⋮ An efficient filtering algorithm for the unary resource constraint with transition times and optional activities ⋮ Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis ⋮ Optimization of setup times in the furniture industry ⋮ Fast approximation algorithms for routing problems with hop-wise constraints ⋮ Changeover formulations for discrete-time mixed-integer programming scheduling models ⋮ Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times ⋮ A constraint programming method for advanced planning and scheduling system with multilevel structured products
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis
- Job shop scheduling with setup times, deadlines and precedence constraints
- The one-machine sequencing problem
- Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
- The job shop scheduling problem: Conventional and new solution techniques
- Practical job shop scheduling
- A branch and bound algorithm for the job-shop scheduling problem
- The job-shop problem and immediate selection
- Job shop scheduling with separable sequence-dependent setups
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
- Deterministic job-shop scheduling: Past, present and future
- A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
- Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study
- A Hybrid Exact Algorithm for the TSPTW
- Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- An Algorithm for Solving the Job-Shop Problem
- A genetic algorithm based procedure for more realistic job shop scheduling problems
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
- Impact of sequence-dependent setup time on job shop scheduling performance
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Job Shop Scheduling by Local Search
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
