Pages that link to "Item:Q1310611"

The following pages link to Constructive heuristic algorithms for the open shop problem (Q1310611):

Displaying 27 items.

• OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises (Q492852) (← links)
• On the open-shop problem with preemption and minimizing the average completion time (Q703917) (← links)
• A contribution and new heuristics for open shop scheduling (Q733548) (← links)
• The museum visitor routing problem (Q969135) (← links)
• Classical and new heuristics for the open-shop problem: A computational evaluation (Q1296088) (← links)
• A branch \(\&\) bound algorithm for the open-shop problem (Q1363739) (← links)
• Job-shop scheduling with processing alternatives. (Q1410614) (← links)
• An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. (Q1422367) (← links)
• A hybrid genetic algorithm for the open shop scheduling problem (Q1576331) (← links)
• A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size (Q1596947) (← links)
• The total completion time open shop scheduling problem with a given sequence of jobs on one machine (Q1603323) (← links)
• Insertion techniques for the heuristic solution of the job shop problem (Q1805458) (← links)
• Heuristics for permutation flow shop scheduling with batch setup times (Q1814870) (← links)
• Scheduling two-machine preemptive open shops to minimize total completion time (Q1885987) (← links)
• A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times (Q1919357) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• New efficient heuristics for scheduling open shops with makespan minimization (Q2147004) (← links)
• Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
• Open shop scheduling problems with conflict graphs (Q2357137) (← links)
• Benchmarks for basic scheduling problems (Q2366085) (← links)
• Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (Q2389828) (← links)
• The representation of partially-concurrent open shop problems (Q2398435) (← links)
• Heuristic constructive algorithms for open shop scheduling to minimize mean flow time (Q2482764) (← links)
• An Optimal Constraint Programming Approach to the Open-Shop Problem (Q2815442) (← links)
• Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan (Q3102811) (← links)
• SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM (Q3393531) (← links)
• A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan (Q6164629) (← links)