Pages that link to "Item:Q988383"

The following pages link to Mathematical models for job-shop scheduling problems with routing and process plan flexibility (Q988383):

Displaying 22 items.

• List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility (Q320008) (← links)
• Evaluation of mathematical models for flexible job-shop scheduling problems (Q350406) (← links)
• An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems (Q440881) (← links)
• Solving the flexible job shop scheduling problem with sequence-dependent setup times (Q1681272) (← links)
• A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities (Q1991454) (← links)
• Metaheuristics for the online printing shop scheduling problem (Q2030284) (← links)
• A survey of job shop scheduling problem: the types and models (Q2146994) (← links)
• An enhanced genetic algorithm with an innovative encoding strategy for flexible job-shop scheduling with operation and processing flexibility (Q2244251) (← 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)
• Flexible job shop scheduling problem for parallel batch processing machine with compatible job families (Q2290149) (← links)
• A study on PGEP to evolve heuristic rules for FJSSP considering the total cost of energy consumption and weighted tardiness (Q2327435) (← links)
• A MILP model for an extended version of the flexible job shop problem (Q2448209) (← links)
• Mixed integer linear programming and constraint programming models for the online printing shop scheduling problem (Q2664355) (← links)
• Real-time production scheduling in the Industry-4.0 context: addressing uncertainties in job arrivals and machine breakdowns (Q2664358) (← links)
• Mathematical modelling and heuristic approaches to job-shop scheduling problem with conveyor-based continuous flow transporters (Q2676401) (← links)
• A research survey: review of flexible job shop scheduling techniques (Q2811943) (← links)
• Loading and scheduling for flexible manufacturing systems with controllable processing times (Q5058957) (← links)
• Auction-based approach for a flexible job-shop scheduling problem with multiple process plans (Q5059253) (← links)
• A Taxonomy for the Flexible Job Shop Scheduling Problem (Q5270504) (← links)
• Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem (Q6164353) (← links)
• A discrete group teaching optimization algorithm for solving many-objective sand casting whole process production scheduling problem (Q6551183) (← links)