Pages that link to "Item:Q1908992"
From MaRDI portal
The following pages link to A generalized permutation approach to job shop scheduling with genetic algorithms (Q1908992):
Displaying 35 items.
- Multi-objectivization via decomposition: an analysis of helper-objectives and complete decomposition (Q319106) (← 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)
- Minimizing makespan for scheduling stochastic job shop with random breakdown (Q388592) (← links)
- A new dispatching rule based genetic algorithm for the multi-objective job shop problem (Q604936) (← links)
- An effective architecture for learning and evolving flexible job-shop schedules (Q858446) (← links)
- Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times (Q964844) (← links)
- Mathematical modeling and evolutionary algorithm-based approach for integrated process planning and scheduling (Q1040966) (← links)
- A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem (Q1046710) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- A repairing technique for the local search of the job-shop problem. (Q1417509) (← links)
- Effects of different chromosome representations in developing genetic algorithms to solve DFJS scheduling problems (Q1652198) (← links)
- Coevolutionary makespan optimisation through different ranking methods for the fuzzy flexible job shop (Q1677019) (← links)
- Cultural-based genetic tabu algorithm for multiobjective job shop scheduling (Q1717896) (← links)
- A competent memetic algorithm for complex scheduling (Q1761722) (← links)
- Some new results on simulated annealing applied to the job shop scheduling problem (Q1806648) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- A knowledge-based evolutionary strategy for scheduling problems with bottlenecks (Q1869426) (← links)
- Resolution of a scheduling problem in a flowshop robotic cell (Q1887770) (← links)
- A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation (Q1887965) (← links)
- Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue (Q1908990) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- An algebraic approach for the search space of permutations with repetition (Q2057112) (← links)
- Multi-objective evolutionary algorithm for solving energy-aware fuzzy job shop problems (Q2156606) (← links)
- Evolutionary tabu search for flexible due-date satisfaction in fuzzy job shop scheduling (Q2177824) (← links)
- A memetic algorithm for the job-shop with time-lags (Q2468490) (← links)
- Integration of process planning and scheduling for distributed flexible job shops (Q2664405) (← links)
- Selection of Auxiliary Objectives Using Landscape Features and Offline Learned Classifier (Q3304196) (← links)
- Supercomputer Scheduling with Combined Evolutionary Techniques (Q3603111) (← links)
- Job shop scheduling optimization through multiple independent particle swarms (Q3639476) (← links)
- Job-Shop Scheduling with Mixed Blocking Constraints between Operations (Q5357765) (← links)
- An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling (Q5416771) (← links)
- Pattern mining‐based pruning strategies in stochastic local searches for scheduling problems (Q6082181) (← links)
- Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem (Q6164375) (← links)
- A memetic algorithm for restoring feasibility in scheduling with limited makespan (Q6177176) (← links)