Pages that link to "Item:Q2464439"
From MaRDI portal
The following pages link to An advanced tabu search algorithm for the job shop problem (Q2464439):
Displayed 45 items.
- A hybrid evolutionary algorithm to solve the job shop scheduling problem (Q324301) (← links)
- An integrated search heuristic for large-scale flexible job shop scheduling problems (Q336652) (← links)
- A tabu search/path relinking algorithm to solve the job shop scheduling problem (Q337272) (← links)
- Genetic tabu search for the fuzzy flexible job shop problem (Q337343) (← links)
- Scatter search with path relinking for the job shop with time lags and setup times (Q337556) (← links)
- Mixed integer programming models for job shop scheduling: A computational analysis (Q342439) (← links)
- Depth-first heuristic search for the job shop scheduling problem (Q363574) (← links)
- Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation (Q398881) (← links)
- An artificial bee colony algorithm for the job shop scheduling problem with random processing times (Q400942) (← links)
- A hybrid differential evolution and tree search algorithm for the job shop scheduling problem (Q410367) (← links)
- A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm (Q411034) (← links)
- Multipath adaptive tabu search for a vehicle control problem (Q411085) (← links)
- A general approach for optimizing regular criteria in the job-shop scheduling problem (Q418093) (← links)
- Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis (Q421447) (← links)
- Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm (Q454950) (← links)
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective (Q614062) (← links)
- Restart strategies in optimization: parallel and serial cases (Q632718) (← links)
- A time-indexed LP-based approach for min-sum job-shop problems (Q646647) (← links)
- Restart strategies for GRASP with path-relinking heuristics (Q691439) (← links)
- Solving job shop scheduling problems utilizing the properties of backbone and ``big valley'' (Q707768) (← links)
- A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem (Q747040) (← links)
- A tabu search algorithm for scheduling pharmaceutical packaging operations (Q1039804) (← links)
- A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem (Q1652506) (← links)
- The job shop scheduling problem with convex costs (Q1754305) (← links)
- On single-walk parallelization of the job shop problem solving algorithms (Q1761161) (← links)
- A competent memetic algorithm for complex scheduling (Q1761722) (← links)
- An algebraic approach for the search space of permutations with repetition (Q2057112) (← links)
- A matheuristic for the generalized order acceptance and scheduling problem (Q2077965) (← links)
- Efficient primal heuristic updates for the blocking job shop problem (Q2239845) (← links)
- Multiobjective optimization for complex flexible job-shop scheduling problems (Q2239940) (← links)
- Nested partitions for the large-scale extended job shop scheduling problem (Q2271832) (← links)
- A multi-objective memetic algorithm for the job-shop scheduling problem (Q2359531) (← links)
- A neighborhood for complex job shop scheduling problems with regular objectives (Q2400045) (← links)
- Scatter search for minimizing weighted tardiness in a single machine scheduling with setups (Q2403268) (← links)
- Job-shop local-search move evaluation without direct consideration of the criterion's value (Q2629670) (← links)
- Instance space analysis and algorithm selection for the job shop scheduling problem (Q2669728) (← links)
- Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search (Q3466772) (← links)
- Multiple colony ant algorithm for job-shop scheduling problem (Q3518511) (← links)
- Resource allocation algorithm for light communication grid-based workflows within an SLA context (Q3612794) (← links)
- A new hybrid parallel genetic algorithm for the job‐shop scheduling problem (Q4980005) (← links)
- Combining prospect theory with fuzzy theory to handle disruption in production scheduling (Q5024608) (← links)
- A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem (Q5387635) (← links)
- An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling (Q5416771) (← links)
- A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems (Q6096569) (← links)
- A memetic algorithm for restoring feasibility in scheduling with limited makespan (Q6177176) (← links)