Pages that link to "Item:Q858446"

The following pages link to An effective architecture for learning and evolving flexible job-shop schedules (Q858446):

Displaying 27 items.

• List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility (Q320008) (← links)
• Path-relinking tabu search for the multi-objective flexible job shop scheduling problem (Q337004) (← 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)
• 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)
• Analysis of the similarities and differences of job-based scheduling problems (Q723975) (← links)
• Double layer ACO algorithm for the multi-objective FJSSP (Q732169) (← links)
• Mathematical models for job-shop scheduling problems with routing and process plan flexibility (Q988383) (← links)
• Accelerating the branch-and-price algorithm using machine learning (Q1653391) (← links)
• A modified biogeography-based optimization for the flexible job shop scheduling problem (Q1664896) (← links)
• Solving the flexible job shop scheduling problem with sequence-dependent setup times (Q1681272) (← links)
• A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach (Q1730479) (← links)
• A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities (Q1991454) (← links)
• Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect (Q2060398) (← links)
• An enhanced genetic algorithm with an innovative encoding strategy for flexible job-shop scheduling with operation and processing flexibility (Q2244251) (← links)
• Hyper-heuristic approaches for the response time variability problem (Q2275609) (← links)
• Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm (Q2284476) (← links)
• Multi-objective optimisation in flexible assembly job shop scheduling using a distributed ant colony system (Q2286964) (← links)
• A priority-based genetic algorithm for a flexible job shop scheduling problem (Q2358304) (← links)
• A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem (Q2427185) (← links)
• Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times (Q2428941) (← links)
• Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem (Q2664300) (← links)
• A research survey: review of flexible job shop scheduling techniques (Q2811943) (← links)
• Scheduling manufacturing systems with blocking: a Petri net approach (Q3055253) (← links)
• A Taxonomy for the Flexible Job Shop Scheduling Problem (Q5270504) (← links)
• Adaptive multimeme algorithm for flexible job shop scheduling problem (Q6191213) (← links)