Pages that link to "Item:Q2147004"

The following pages link to New efficient heuristics for scheduling open shops with makespan minimization (Q2147004):

Displaying 19 items.

• Flexible open shop scheduling problem to minimize makespan (Q342284) (← links)
• A contribution and new heuristics for open shop scheduling (Q733548) (← links)
• Makespan minimization in open shops: A polynomial time approximation scheme (Q1290641) (← links)
• Classical and new heuristics for the open-shop problem: A computational evaluation (Q1296088) (← links)
• Constructive heuristic algorithms for the open shop problem (Q1310611) (← links)
• Competitive genetic algorithms for the open-shop scheduling problem (Q1401639) (← links)
• A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop (Q1792291) (← links)
• A linear time approximation scheme for makespan minimization in an open shop with release dates (Q1866011) (← links)
• A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times (Q2183852) (← links)
• A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures (Q2475628) (← links)
• Heuristic constructive algorithms for open shop scheduling to minimize mean flow time (Q2482764) (← links)
• Characteristics of machine order matrix of open shop scheduling problems (Q2868000) (← links)
• On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem (Q5168014) (← links)
• Non‐greedy heuristics and augmented neural networks for the open‐shop scheduling problem (Q5438534) (← links)
• Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function (Q5471126) (← links)
• A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions (Q6048209) (← links)
• Modeling and solving the problem of scheduling university exams in terms of new constraints on the conflicts of professors' exams and the concurrence of exams with common questions (Q6059861) (← links)
• A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization (Q6068709) (← links)
• The LPT heuristic for minimizing total load on a proportionate openshop (Q6110607) (← links)