Pages that link to "Item:Q940884"
From MaRDI portal
The following pages link to A branch and bound method for the job-shop problem with sequence-dependent setup times (Q940884):
Displaying 16 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)
- Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP) (Q363579) (← links)
- Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis (Q421447) (← links)
- Fast approximation algorithms for routing problems with hop-wise constraints (Q490222) (← links)
- Job shop scheduling with setup times, deadlines and precedence constraints (Q835609) (← links)
- Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times (Q964844) (← links)
- Group-shop scheduling with sequence-dependent set-up and transportation times (Q1634110) (← links)
- Changeover formulations for discrete-time mixed-integer programming scheduling models (Q1753514) (← links)
- Optimization of setup times in the furniture industry (Q1945078) (← links)
- A numerical method for interval multi-objective mixed-integer optimal control problems based on quantum heuristic algorithm (Q2150758) (← links)
- An efficient filtering algorithm for the unary resource constraint with transition times and optional activities (Q2197325) (← links)
- A constraint programming method for advanced planning and scheduling system with multilevel structured products (Q2321546) (← 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)
