Pages that link to "Item:Q2367003"
From MaRDI portal
The following pages link to Applying tabu search to the job-shop scheduling problem (Q2367003):
Displayed 29 items.
- On a scheduling problem in a robotized analytical system (Q1917278) (← links)
- An improved tabu search approach for solving the job shop scheduling problem with tooling constraints (Q1917279) (← links)
- A comparison of local search methods for flow shop scheduling (Q1919857) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem (Q1969832) (← links)
- Nested partitions for the large-scale extended job shop scheduling problem (Q2271832) (← links)
- A very fast TS/SA algorithm for the job shop scheduling problem (Q2384605) (← links)
- A prediction based iterative decomposition algorithm for scheduling large-scale job shops (Q2473277) (← links)
- A tabu search algorithm for structural software testing (Q2482359) (← links)
- Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem (Q2489308) (← links)
- An integrated approach for modeling and solving the scheduling problem of container handling systems (Q2508124) (← links)
- Modelling and heuristics of FMS scheduling with multiple objectives (Q2566932) (← links)
- Hybrid simulated annealing with memory: an evolution-based diversification approach (Q3163188) (← links)
- Multi-agent based beam search for intelligent production planning and scheduling (Q3163302) (← links)
- Competitive methods for multi-level lot sizing and scheduling: tabu search and randomized regrets (Q4230222) (← links)
- (Q4239710) (← links)
- A hierarchical bicriterion approach to integrated process plan selection and job shop scheduling (Q4398900) (← links)
- Continuous flow models for batch manufacturing: a basis for a hierarchical approach (Q4398998) (← links)
- Alternative graph formulation for solving complex factory-scheduling problems (Q4415989) (← links)
- METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM (Q4650620) (← links)
- Minimizing <i>L</i> <sub>max</sub> for large-scale, job-shop scheduling problems (Q4671351) (← links)
- An Extensive Tabu Search Algorithm for Solving the Lot Streaming Problem in a Job Shop Environment (Q5391876) (← links)
- Evaluating artificial intelligence heuristics for a flexible Kanban system: simultaneous Kanban controlling and scheduling (Q5426585) (← links)
- Scheduling contractors' farm‐to‐farm crop harvesting operations (Q5488239) (← links)
- Heuristics from Nature for Hard Combinatorial Optimization Problems (Q5690286) (← links)
- Optimizing the system of virtual paths by tabu search. (Q5928385) (← links)
- An effective hybrid optimization strategy for job-shop scheduling problems (Q5936137) (← links)
- Local search algorithms for a single-machine scheduling problem with positive and negative time-lags (Q5946822) (← links)
- Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs (Q5953158) (← links)