Pages that link to "Item:Q1317529"
From MaRDI portal
The following pages link to Tabu search for the job-shop scheduling problem with multi-purpose machines (Q1317529):
Displaying 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-dimensional tabu search algorithm for the optimization of process planning (Q425066) (← links)
- An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems (Q440881) (← links)
- Multi-population interactive coevolutionary algorithm for flexible job shop scheduling problems (Q626658) (← links)
- Tabu search algorithms for job-shop problems with a single transport robot (Q707135) (← links)
- Double layer ACO algorithm for the multi-objective FJSSP (Q732169) (← links)
- A taxonomy of flexible flow line scheduling procedures (Q859681) (← links)
- Tabu search algorithms for cyclic machine scheduling problems (Q880506) (← links)
- Flexible job shop scheduling with overlapping in operations (Q965603) (← links)
- Discrepancy search for the flexible job shop scheduling problem (Q991381) (← links)
- A tabu search algorithm for scheduling pharmaceutical packaging operations (Q1039804) (← 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)
- A new tabu search procedure for an audit-scheduling problem (Q1297694) (← links)
- A capacity-oriented hierarchical approach to single-item and small-batch production planning using project-scheduling methods (Q1374387) (← links)
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search (Q1374441) (← links)
- Tabu-search for the multi-mode job-shop problem (Q1384220) (← links)
- Job-shop scheduling with processing alternatives. (Q1410614) (← links)
- Local search algorithms for the multiprocessor flow shop scheduling problem (Q1592744) (← links)
- Tabu search for resource-constrained scheduling (Q1609891) (← links)
- A tabu search approach to machine scheduling (Q1609892) (← links)
- A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup times (Q1643055) (← links)
- Solving the flexible job shop scheduling problem with sequence-dependent setup times (Q1681272) (← links)
- A batch-oblivious approach for complex job-shop scheduling problems (Q1695012) (← links)
- A worker constrained flexible job shop scheduling problem with sequence-dependent setup times (Q1733093) (← links)
- Large-scale medical examination scheduling technology based on intelligent optimization (Q1740432) (← links)
- The job shop scheduling problem with convex costs (Q1754305) (← links)
- A heuristic to schedule flexible job-shop in a glass factory (Q1772853) (← links)
- Lower bounds for the job-shop scheduling problem on multi-purpose machines (Q1805453) (← links)
- An improved tabu search approach for solving the job shop scheduling problem with tooling constraints (Q1917279) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Effective neighbourhood functions for the flexible job shop problem (Q1976516) (← 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 simulated multi-objective model for flexible job shop transportation scheduling (Q2150761) (← links)
- A new leader guided optimization for the flexible job shop problem (Q2292167) (← links)
- A study on PGEP to evolve heuristic rules for FJSSP considering the total cost of energy consumption and weighted tardiness (Q2327435) (← links)
- A priority-based genetic algorithm for a flexible job shop scheduling problem (Q2358304) (← links)
- Applying tabu search to the job-shop scheduling problem (Q2367003) (← links)
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective (Q2379653) (← links)
- A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem (Q2427185) (← links)
- A tabu search approach for proportionate multiprocessor open shop scheduling (Q2450907) (← links)
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems (Q2475846) (← links)
- A genetic algorithm for the flexible job-shop scheduling problem (Q2482369) (← links)
- Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem (Q2664300) (← links)