Pages that link to "Item:Q1296088"
From MaRDI portal
The following pages link to Classical and new heuristics for the open-shop problem: A computational evaluation (Q1296088):
Displaying 22 items.
- OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises (Q492852) (← links)
- A contribution and new heuristics for open shop scheduling (Q733548) (← links)
- The museum visitor routing problem (Q969135) (← links)
- Constructive heuristic algorithms for the open shop problem (Q1310611) (← 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)
- Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems (Q1590040) (← links)
- The total completion time open shop scheduling problem with a given sequence of jobs on one machine (Q1603323) (← links)
- An effective heuristic algorithm for the partial shop scheduling problem (Q1652579) (← links)
- Scheduling two-machine preemptive open shops to minimize total completion time (Q1885987) (← 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)
- A genetic algorithm for scheduling open shops with sequence-dependent setup times (Q2333145) (← links)
- Open shop scheduling problems with conflict graphs (Q2357137) (← links)
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (Q2389828) (← links)
- A new particle swarm optimization for the open shop scheduling problem (Q2482375) (← links)
- SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM (Q3393531) (← links)
- Solving the open shop scheduling problem (Q5939272) (← links)
- A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions (Q6048209) (← 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)
- A review on integrated scheduling and outbound vehicle routing problems (Q6168583) (← links)
