Pages that link to "Item:Q2400045"
From MaRDI portal
The following pages link to A neighborhood for complex job shop scheduling problems with regular objectives (Q2400045):
Displaying 14 items.
- A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective (Q342161) (← links)
- A general approach for optimizing regular criteria in the job-shop scheduling problem (Q418093) (← links)
- A new neighborhood and tabu search for the blocking job shop (Q967433) (← links)
- On the complexity of two machine job-shop scheduling with regular objective functions (Q1374404) (← links)
- A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup times (Q1643055) (← links)
- The job shop scheduling problem with convex costs (Q1754305) (← links)
- Effective neighbourhood functions for the flexible job shop problem (Q1976516) (← links)
- Scheduling for multi-robot routing with blocking and enabling constraints (Q2059084) (← links)
- Efficient primal heuristic updates for the blocking job shop problem (Q2239845) (← links)
- The no-wait job shop with regular objective: a method based on optimal job insertion (Q2359802) (← links)
- Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems (Q2792203) (← links)
- A Permutation-Based Neighborhood for the Blocking Job-Shop Problem with Total Tardiness Minimization (Q4685816) (← links)
- Evolutionary Computation in Combinatorial Optimization (Q5901721) (← links)
- Pattern mining‐based pruning strategies in stochastic local searches for scheduling problems (Q6082181) (← links)