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):
Displayed 10 items.
- A contribution and new heuristics for open shop scheduling (Q733548) (← 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)
- Scheduling two-machine preemptive open shops to minimize total completion time (Q1885987) (← 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)