Pages that link to "Item:Q5939272"

The following pages link to Solving the open shop scheduling problem (Q5939272):

Displaying 23 items.

• OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises (Q492852) (← links)
• Scheduling and constraint propagation (Q697570) (← links)
• A contribution and new heuristics for open shop scheduling (Q733548) (← links)
• Arc-B-consistency of the inter-distance constraint (Q879973) (← links)
• The museum visitor routing problem (Q969135) (← links)
• Open shop problem with zero-one time operations and integer release date/deadline intervals (Q1363753) (← links)
• Constraint programming and operations research (Q1616390) (← links)
• An effective heuristic algorithm for the partial shop scheduling problem (Q1652579) (← links)
• Partially concurrent open shop scheduling with integral preemptions (Q1698281) (← links)
• Dynamic programming approach for solving the open shop problem (Q2033324) (← links)
• A novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates (Q2160790) (← links)
• Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
• Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (Q2389828) (← links)
• Open-shop dense schedules: properties and worst-case performance ratio (Q2434260) (← links)
• A new particle swarm optimization for the open shop scheduling problem (Q2482375) (← links)
• Heuristic constructive algorithms for open shop scheduling to minimize mean flow time (Q2482764) (← links)
• Time buffers in the open shop problem (Q2786901) (← 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)
• (Q3801319) (← links)
• (Q3832310) (← links)
• Openshop scheduling under linear resources constraints (Q4381875) (← links)
• Computing relaxations for the three-dimensional stable matching problem with cyclic preferences (Q6073306) (← links)