A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
From MaRDI portal
Publication:1919357
DOI10.1007/BF01539706zbMath0852.90087MaRDI QIDQ1919357
Publication date: 5 August 1996
Published in: OR Spektrum (Search for Journal in Brave)
disjunctive graph modelprecedence relationsjob-shop problemopen-shop problemsequence dependent setup-times
Related Items
Constraint programming and operations research, Job shop scheduling with setup times, deadlines and precedence constraints, Group-shop scheduling with sequence-dependent set-up and transportation times, 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, A neighborhood for complex job shop scheduling problems with regular objectives, Depth-first heuristic search for the job shop scheduling problem, An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem, Optimization of the integrated problem of employee timetabling and job shop scheduling, 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, A branch and bound method for the job-shop problem with sequence-dependent setup times, A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence 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 competent memetic algorithm for complex scheduling, Scheduling and constraint propagation, Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches, Tabu search algorithms for job-shop problems with a single transport robot, The blocking job shop with rail-bound transportation, Simulation-based metamodels for scheduling a dynamic job shop with sequence-dependent setup times, Constraint-directed techniques for scheduling alternative activities, Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis
Cites Work
- Unnamed Item
- Unnamed Item
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- Constructive heuristic algorithms for the open shop problem
- A branch and bound algorithm for the job-shop scheduling problem
- The job-shop problem and immediate selection
- Heuristics for permutation flow shop scheduling with batch setup times
- Benchmarks for basic scheduling problems
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- An Algorithm for Solving the Job-Shop Problem
- A Computational Study of the Job-Shop Scheduling Problem
- On the Complexity of Scheduling with Batch Setup Times
