Pages that link to "Item:Q1976516"
From MaRDI portal
The following pages link to Effective neighbourhood functions for the flexible job shop problem (Q1976516):
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 objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms (Q342413) (← links)
- A general approach for optimizing regular criteria in the job-shop scheduling problem (Q418093) (← 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)
- Double layer ACO algorithm for the multi-objective FJSSP (Q732169) (← links)
- Feasible insertions in job shop scheduling, short cycles and stable sets (Q856271) (← links)
- A tabu search approach for scheduling hazmat shipments (Q856786) (← links)
- Flexible job shop scheduling with overlapping in operations (Q965603) (← 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)
- Job-shop scheduling with processing alternatives. (Q1410614) (← links)
- A repairing technique for the local search of the job-shop problem. (Q1417509) (← links)
- A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup times (Q1643055) (← links)
- Effects of different chromosome representations in developing genetic algorithms to solve DFJS scheduling problems (Q1652198) (← links)
- A modified biogeography-based optimization for the flexible job shop scheduling problem (Q1664896) (← links)
- Coevolutionary makespan optimisation through different ranking methods for the fuzzy flexible job shop (Q1677019) (← 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)
- An improved shuffled frog-leaping algorithm for flexible job shop scheduling problem (Q1736634) (← links)
- Solving flexible job-shop scheduling problem using gravitational search algorithm and colored Petri net (Q1760793) (← links)
- Maximum satisfiability: how good are tabu search and plateau moves in the worst-case? (Q1779533) (← links)
- A lower bound for the job insertion problem. (Q1811122) (← links)
- Design of computational processes in hierarchic systems (Q1951944) (← 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)
- Metaheuristics for the online printing shop scheduling problem (Q2030284) (← links)
- A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system (Q2052988) (← links)
- A simulated multi-objective model for flexible job shop transportation scheduling (Q2150761) (← links)
- Multiobjective optimization for complex flexible job-shop scheduling problems (Q2239940) (← links)
- A sequencing approach for creating new train timetables (Q2267382) (← links)
- Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm (Q2284476) (← links)
- A new leader guided optimization for the flexible job shop problem (Q2292167) (← links)
- A priority-based genetic algorithm for a flexible job shop scheduling problem (Q2358304) (← links)
- A disjunctive graph model and framework for constructing new train schedules (Q2379528) (← links)
- A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem (Q2427185) (← links)
- Surgical case scheduling as a generalized job shop scheduling problem (Q2464181) (← 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)
- Scheduling unit length jobs with parallel nested machine processing set restrictions (Q2566928) (← links)
- Hybridizing discrete- and continuous-time models for batch sizing and scheduling problems (Q2571190) (← links)
- A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times (Q2668713) (← links)
- A hybrid genetic-particle swarm algorithm based on multilevel neighbourhood structure for flexible job shop scheduling problem (Q2669530) (← links)
