Pages that link to "Item:Q2366999"
From MaRDI portal
The following pages link to Routing and scheduling in a flexible job shop by tabu search (Q2366999):
Displayed 50 items.
- List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility (Q320008) (← links)
- An integrated search heuristic for large-scale flexible job shop scheduling problems (Q336652) (← links)
- Path-relinking tabu search for the multi-objective flexible job shop scheduling problem (Q337004) (← links)
- Genetic tabu search for the fuzzy flexible job shop problem (Q337343) (← links)
- Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate (Q337585) (← links)
- Heuristic approaches for scheduling jobs in large-scale flexible job shops (Q342300) (← links)
- A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms (Q342413) (← links)
- Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements (Q342448) (← links)
- An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems (Q440881) (← links)
- Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in small and medium enterprises (Q492824) (← links)
- Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling (Q508765) (← links)
- Multi-population interactive coevolutionary algorithm for flexible job shop scheduling problems (Q626658) (← links)
- Analysis of the similarities and differences of job-based scheduling problems (Q723975) (← links)
- Double layer ACO algorithm for the multi-objective FJSSP (Q732169) (← links)
- A tabu search approach for scheduling hazmat shipments (Q856786) (← links)
- An effective architecture for learning and evolving flexible job-shop schedules (Q858446) (← links)
- A taxonomy of flexible flow line scheduling procedures (Q859681) (← links)
- Flexible job shop scheduling with overlapping in operations (Q965603) (← links)
- Mathematical models for job-shop scheduling problems with routing and process plan flexibility (Q988383) (← links)
- Discrepancy search for the flexible job shop scheduling problem (Q991381) (← links)
- Computing lower and upper bounds for a large-scale industrial job shop scheduling problem (Q1011298) (← links)
- An improved genetic algorithm for the distributed and flexible job-shop scheduling problem (Q1042492) (← links)
- Multi-resource shop scheduling with resource flexibility (Q1296087) (← links)
- Tabu search for the job-shop scheduling problem with multi-purpose machines (Q1317529) (← links)
- Job-shop scheduling with processing alternatives. (Q1410614) (← links)
- A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling. (Q1413813) (← links)
- Local search algorithms for the multiprocessor flow shop scheduling problem (Q1592744) (← links)
- Dispatching algorithm for production programming of flexible job-shop systems in the smart factory industry (Q1639306) (← links)
- A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup times (Q1643055) (← links)
- A modified biogeography-based optimization for the flexible job shop scheduling problem (Q1664896) (← links)
- Pareto-ranking based quantum-behaved particle swarm optimization for multiobjective optimization (Q1667014) (← links)
- Decomposition techniques with mixed integer programming and heuristics for home healthcare planning (Q1699130) (← links)
- An improved shuffled frog-leaping algorithm for flexible job shop scheduling problem (Q1736634) (← links)
- The job shop scheduling problem with convex costs (Q1754305) (← links)
- Solving flexible job-shop scheduling problem using gravitational search algorithm and colored Petri net (Q1760793) (← links)
- A heuristic to schedule flexible job-shop in a glass factory (Q1772853) (← links)
- Exploiting process plan flexibility in production scheduling: A multi-objective approach (Q1809824) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems (Q1954823) (← links)
- A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities (Q1991454) (← links)
- A novel memetic algorithm based on decomposition for multiobjective flexible job shop scheduling problem (Q1992548) (← links)
- A new energy-aware flexible job shop scheduling method using modified biogeography-based optimization (Q1993083) (← links)
- An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria (Q2003434) (← links)
- Scenario-based learning for stochastic combinatorial optimisation (Q2011603) (← links)
- Metaheuristics for the online printing shop scheduling problem (Q2030284) (← links)
- A new heuristic and an exact approach for a production planning problem (Q2051214) (← links)
- A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system (Q2052988) (← links)
- Integrating preferences within multiobjective flexible job shop scheduling (Q2103005) (← links)
- A simulated multi-objective model for flexible job shop transportation scheduling (Q2150761) (← links)
- Spatial-domain fitness landscape analysis for combinatorial optimization (Q2200693) (← links)