Pages that link to "Item:Q958458"

The following pages link to Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm (Q958458):

Displaying 17 items.

• 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)
• Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (Q342177) (← links)
• A binary multiple knapsack model for single machine scheduling with machine unavailability (Q342369) (← links)
• Variable neighbourhood search: methods and applications (Q970194) (← links)
• Variable neighbourhood search: Methods and applications (Q1029572) (← links)
• A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855) (← links)
• A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion (Q1761140) (← links)
• Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems (Q1761190) (← links)
• Fast heuristics for minimizing the makespan in non-permutation flow shops (Q1782179) (← links)
• Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem (Q1992647) (← links)
• Flow shop scheduling with heterogeneous workers (Q2254003) (← links)
• A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times (Q2270448) (← links)
• An uncertain permutation flow shop predictive scheduling problem with processing interruption (Q2683283) (← links)
• SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM (Q3393531) (← links)
• Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues (Q4979992) (← links)
• An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times (Q5172564) (← links)