Pages that link to "Item:Q2366085"

The following pages link to Benchmarks for basic scheduling problems (Q2366085):

Displaying 50 items.

• A scatter search algorithm for the distributed permutation flowshop scheduling problem (Q297245) (← links)
• New hard benchmark for flowshop scheduling problems minimising makespan (Q300036) (← links)
• Clustered enhanced differential evolution for the blocking flow shop scheduling problem (Q300862) (← links)
• New effective MILP models for PFSPs arising from real applications (Q301126) (← links)
• MILP models for the optimization of real production lines (Q302141) (← links)
• Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem (Q309064) (← links)
• Refined ranking relations for selection of solutions in multi objective metaheuristics (Q319120) (← links)
• Job-shop production scheduling with reverse flows (Q319298) (← links)
• On heuristic solutions for the stochastic flowshop scheduling problem (Q319784) (← links)
• A real-time order acceptance and scheduling approach for permutation flow shop problems (Q320020) (← links)
• A multi-agent based cooperative approach to scheduling and routing (Q323308) (← links)
• Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm (Q336334) (← links)
• A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem (Q336357) (← links)
• Optimizing blocking flow shop scheduling problem with total completion time criterion (Q336393) (← links)
• On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem (Q336966) (← links)
• Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools (Q337131) (← links)
• A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion (Q337223) (← links)
• A new set of high-performing heuristics to minimise flowtime in permutation flowshops (Q337260) (← links)
• Genetic tabu search for the fuzzy flexible job shop problem (Q337343) (← links)
• Variability of completion time differences in permutation flow shop scheduling (Q337356) (← links)
• Battery swap station location-routing problem with capacitated electric vehicles (Q337428) (← links)
• A discrete inter-species cuckoo search for flowshop scheduling problems (Q337568) (← links)
• A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime (Q339553) (← links)
• Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness (Q342073) (← links)
• A generalized constructive algorithm using insertion-based heuristics (Q342160) (← links)
• A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective (Q342161) (← links)
• Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics (Q342173) (← links)
• Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (Q342177) (← links)
• Mixed integer programming models for job shop scheduling: A computational analysis (Q342439) (← links)
• New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem (Q342481) (← links)
• A biased random key genetic algorithm for the field Technician scheduling problem (Q342506) (← links)
• On optimizing a bi-objective flowshop scheduling problem in an uncertain environment (Q356401) (← links)
• Depth-first heuristic search for the job shop scheduling problem (Q363574) (← links)
• Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation (Q398881) (← links)
• A general approach for optimizing regular criteria in the job-shop scheduling problem (Q418093) (← links)
• Exact resolution of the two-stage hybrid flow shop with dedicated machines (Q479265) (← links)
• OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises (Q492852) (← links)
• General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach (Q497626) (← links)
• Fitness landscape analysis for the no-wait flow-shop scheduling problem (Q519086) (← links)
• On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems (Q519093) (← links)
• A cooperative hyper-heuristic search framework (Q604941) (← links)
• A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems (Q632658) (← links)
• Restart strategies in optimization: parallel and serial cases (Q632718) (← links)
• Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems (Q666941) (← links)
• On the heuristic solution of the permutation flow shop problem by path algorithms (Q690012) (← links)
• On the open-shop problem with preemption and minimizing the average completion time (Q703917) (← links)
• Solving job shop scheduling problems utilizing the properties of backbone and ``big valley'' (Q707768) (← links)
• A library of local search heuristics for the vehicle routing problem (Q708775) (← links)
• An efficient heuristic for adaptive production scheduling and control in one-of-a-kind production (Q709140) (← links)
• Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness (Q711284) (← links)