Pages that link to "Item:Q1363739"
From MaRDI portal
The following pages link to A branch \(\&\) bound algorithm for the open-shop problem (Q1363739):
Displayed 18 items.
- A contribution and new heuristics for open shop scheduling (Q733548) (← links)
- Compiling finite linear CSP into SAT (Q842794) (← links)
- A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags (Q1293191) (← links)
- Multi-resource shop scheduling with resource flexibility (Q1296087) (← links)
- Classical and new heuristics for the open-shop problem: A computational evaluation (Q1296088) (← 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)
- 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)
- Local search with constraint propagation and conflict-based heuristics (Q1606115) (← links)
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling (Q1764767) (← 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)
- Local search algorithms for a single-machine scheduling problem with positive and negative time-lags (Q5946822) (← links)