Pages that link to "Item:Q1174353"
From MaRDI portal
The following pages link to Job-shop scheduling with multi-purpose machines (Q1174353):
Displaying 50 items.
- 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)
- Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements (Q342448) (← links)
- An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems (Q440881) (← links)
- Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling (Q508765) (← 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)
- 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)
- A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags (Q1293191) (← links)
- Multi-resource shop scheduling with resource flexibility (Q1296087) (← links)
- Tabu search for the job-shop scheduling problem with multi-purpose machines (Q1317529) (← links)
- Tabu-search for the multi-mode job-shop problem (Q1384220) (← links)
- The complexity of two-job shop problems with multi-purpose unrelated machines. (Q1410331) (← links)
- Job-shop scheduling with processing alternatives. (Q1410614) (← links)
- Concurrent operations can be parallelized in scheduling multiprocessor job shop (Q1607976) (← links)
- Effects of different chromosome representations in developing genetic algorithms to solve DFJS scheduling problems (Q1652198) (← links)
- An extensive operations and maintenance planning problem with an efficient solution method (Q1652643) (← 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 worker constrained flexible job shop scheduling problem with sequence-dependent setup times (Q1733093) (← links)
- Solving flexible job-shop scheduling problem using gravitational search algorithm and colored Petri net (Q1760793) (← links)
- Lower bounds for the job-shop scheduling problem on multi-purpose machines (Q1805453) (← links)
- A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems (Q1954823) (← links)
- Effective neighbourhood functions for the flexible job shop problem (Q1976516) (← links)
- Solving a multi-resource partial-ordering flexible variant of the job-shop scheduling problem with hybrid ASP (Q2055805) (← links)
- Genetic programming with adaptive search based on the frequency of features for dynamic flexible job shop scheduling (Q2057128) (← links)
- A simulated multi-objective model for flexible job shop transportation scheduling (Q2150761) (← links)
- A logic-based Benders decomposition for microscopic railway timetable planning (Q2158004) (← links)
- Multipopulation genetic algorithms with different interaction structures to solve flexible job-shop scheduling problems: a network science perspective (Q2217021) (← links)
- Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm (Q2284476) (← links)
- A priority-based genetic algorithm for a flexible job shop scheduling problem (Q2358304) (← links)
- A new lower bound for the job-shop scheduling problem (Q2366077) (← links)
- Complexity of shop-scheduling problems with fixed number of jobs: a survey (Q2460037) (← links)
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems (Q2475846) (← links)
- Asymptotically optimal schedules for single-server flow shop problems with setup costs and times (Q2488240) (← links)
- Real-time production scheduling in the Industry-4.0 context: addressing uncertainties in job arrivals and machine breakdowns (Q2664358) (← 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)
- An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning (Q2672113) (← links)
- A research survey: review of flexible job shop scheduling techniques (Q2811943) (← links)
- Immersed NURBS for CFD Applications (Q2948918) (← links)
- A variable neighbourhood search algorithm for the flexible job-shop scheduling problem (Q3163164) (← links)
- A multi-agent system for integrated scheduling and maintenance planning of the flexible job shop (Q6047924) (← links)
- Flexible job-shop scheduling with transportation resources (Q6087485) (← links)
- Lexicographic optimization‐based clustering search metaheuristic for the multiobjective flexible job shop scheduling problem (Q6092613) (← links)
