Pages that link to "Item:Q1919357"
From MaRDI portal
The following pages link to A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times (Q1919357):
Displayed 24 items.
- Scatter search with path relinking for the job shop with time lags and setup times (Q337556) (← links)
- An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times (Q339586) (← links)
- Depth-first heuristic search for the job shop scheduling problem (Q363574) (← links)
- Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis (Q421447) (← links)
- Scheduling and constraint propagation (Q697570) (← links)
- Tabu search algorithms for job-shop problems with a single transport robot (Q707135) (← links)
- Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis (Q817121) (← links)
- Job shop scheduling with setup times, deadlines and precedence constraints (Q835609) (← links)
- An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem (Q875429) (← links)
- A branch and bound method for the job-shop problem with sequence-dependent setup times (Q940884) (← links)
- Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times (Q964844) (← links)
- Constraint-directed techniques for scheduling alternative activities (Q1583239) (← links)
- Constraint programming and operations research (Q1616390) (← links)
- Group-shop scheduling with sequence-dependent set-up and transportation times (Q1634110) (← links)
- A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints (Q1752766) (← links)
- Changeover formulations for discrete-time mixed-integer programming scheduling models (Q1753514) (← links)
- A competent memetic algorithm for complex scheduling (Q1761722) (← links)
- An efficient filtering algorithm for the unary resource constraint with transition times and optional activities (Q2197325) (← links)
- A neighborhood for complex job shop scheduling problems with regular objectives (Q2400045) (← links)
- Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches (Q2485332) (← links)
- Optimization of the integrated problem of employee timetabling and job shop scheduling (Q2669607) (← links)
- Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search (Q3466772) (← links)
- Simulation-based metamodels for scheduling a dynamic job shop with sequence-dependent setup times (Q3623397) (← links)
- The blocking job shop with rail-bound transportation (Q5963615) (← links)