Pages that link to "Item:Q2471233"

The following pages link to A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem (Q2471233):

Displaying 35 items.

• A hybrid evolutionary algorithm to solve the job shop scheduling problem (Q324301) (← links)
• Genetic tabu search for the fuzzy flexible job shop problem (Q337343) (← 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)
• Heuristic approaches for scheduling jobs in large-scale flexible job shops (Q342300) (← links)
• Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation (Q398881) (← links)
• A hybrid differential evolution and tree search algorithm for the job shop scheduling problem (Q410367) (← links)
• A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm (Q411034) (← links)
• A general approach for optimizing regular criteria in the job-shop scheduling problem (Q418093) (← links)
• An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective (Q439458) (← links)
• Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times (Q474643) (← links)
• Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time (Q613775) (← links)
• A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective (Q614062) (← links)
• A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem (Q622145) (← links)
• Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times (Q622157) (← links)
• Solving scheduling problems from high-level models (Q657573) (← links)
• A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function (Q693656) (← links)
• Algorithms for a realistic variant of flowshop scheduling (Q732880) (← links)
• A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem (Q747040) (← links)
• A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival (Q991390) (← links)
• Order acceptance using genetic algorithms (Q1000954) (← links)
• Computing minimal doubly resolving sets of graphs (Q1013386) (← links)
• A two-machine flowshop scheduling problem with precedence constraint on two jobs (Q1701710) (← links)
• Metaheuristics for order scheduling problem with unequal ready times (Q1727107) (← links)
• Extended GRASP for the job shop scheduling problem with total weighted tardiness objective (Q1753631) (← links)
• The job shop scheduling problem with convex costs (Q1754305) (← links)
• Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates (Q1762109) (← links)
• Genetic algorithm for job scheduling with maintenance consideration in semiconductor manufacturing process (Q1955314) (← links)
• Evolutionary tabu search for flexible due-date satisfaction in fuzzy job shop scheduling (Q2177824) (← links)
• On the optimal modeling and evaluation of job shops with a total weighted tardiness objective: constraint programming vs. mixed integer programming (Q2337226) (← links)
• A priority-based genetic algorithm for a flexible job shop scheduling problem (Q2358304) (← links)
• Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times (Q2378452) (← links)
• A SINGLE-MACHINE TWO-AGENT SCHEDULING PROBLEM BY GA APPROACH (Q2911577) (← links)
• A hybrid iterated local search algorithm with adaptive perturbation mechanism by success-history based parameter adaptation for differential evolution (SHADE) (Q5059314) (← links)
• Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration (Q5174416) (← links)